Submission

Score: 0

User: andamanlnwza007

Problemset: ขนมปัง

Language: cpp

Time: 0.002 second

Submitted On: 2025-10-07 09:28:37

#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
using namespace std;
int main(){
	int w,h,n,m,result1,result2;
	cin>>w>>ws>>h>>ws>>n>>ws>>m;
	int mlist[m],nlist[n];
	mlist[0]=0;
	for (int i=1 ; i <m ; i++){
		cin>>mlist[i];
		if (i!=m){
			cin>>ws;
		}
	}
	mlist[m]=w;
	for (int i=0 ; i <n ; i++){
		cin>>nlist[i];
		if (i!=n-1){
			cin>>ws;
		}
	}
	int frist=0 , second=1;
	sort(nlist,nlist+n);
	int hight = abs(nlist[1]-nlist[0]);
	for (int i =0 ; i < m ;i++){ 
		if (abs(mlist[frist]-mlist[second])*hight>result1){
			result2=result1;
			result1=abs(mlist[frist]-mlist[second])*hight;	
			}
		else if(abs(mlist[frist]-mlist[second])*hight>result2){
			result2=abs(mlist[frist]-mlist[second])*hight;
		}
		frist+=1;
		second+=1;
		}
	cout<<result1<<" "<<result2;
	}