Submission

[PPPP][-SSS][-SSS][-SSS][-SSS][-SSS][PPPP][P-SS]

Score: 26

User: realcaramel

Problemset: ขนมปัง

Language: cpp

Time: 0.002 second

Submitted On: 2024-11-24 22:43:33

#include <bits/stdc++.h>
using namespace std;
int main(){
	int w,h,n,m,maxw=0,maxh=0;
	cin>>w>>h>>n>>m;
	int a[n+1],b[m+1],t1,t2;
	cin>>t1,a[0]=t1;
	for(int i=1;i<n;i++){
		cin>>t2;a[i]=t2-t1;t1=t2;
	}
	a[n]=w-t1;
	cin>>t1,b[0]=t1;
	for(int i=1;i<m;i++){
		cin>>t2,b[i]=t2-t1,t1=t2;
	}
	b[m]=h-t1;
	sort(a,a+n+1),sort(b,b+m+1);
	cout<<a[n]*b[m]<<" "<<((a[n-1]>b[m-1])?a[n-1]*b[m]:a[n]*b[m-1]);
	return 0;
}