Submission

Score: 100

User: SonnyHappy108

Problemset: ขนมปัง

Language: cpp

Time: 0.002 second

Submitted On: 2026-04-20 12:38:24

#include <iostream>
using namespace std;
int main(){
	int i;
	int W,H;
	cin >> W >> H;
	int M,N;
	cin >> M >> N;
	int X[M+1],Y[N+1];
	for(i=0;i<M;i++){
		cin >> X[i];
	}
	X[M]=W;
	for(i=0;i<N;i++){
		cin >> Y[i];
	}
	Y[N]=H;
	int maxx1=X[0],maxx2=0;
	for(i=1;i<M+1;i++){
		if(X[i]-X[i-1]>maxx1){
			maxx2=maxx1;
			maxx1=X[i]-X[i-1];
		}
		else if (X[i]-X[i-1]>maxx2){
			maxx2=X[i]-X[i-1];
		}
	}
	int maxy1=Y[0],maxy2=0;
	for(i=1;i<N+1;i++){
		if(Y[i]-Y[i-1]>maxy1){
			maxy2=maxy1;
			maxy1=Y[i]-Y[i-1];
		}
		else if (Y[i]-Y[i-1]>maxy2){
			maxy2=Y[i]-Y[i-1];
		}
	}
	int max = maxx1 * maxy1;
	int max1 = maxx1 * maxy2;
	int max2 = maxx2 * maxy1;
	int max0;
	if(max1>max2){
		max0=max1;
	}
	else{
		max0=max2;
	}
	cout << max << " " << max0;
}