Submission

Score: 100

User: lingusso

Problemset: ขนมปัง

Language: cpp

Time: 0.003 second

Submitted On: 2026-04-07 20:22:07

#include<iostream>
#include<string>
using namespace std;

int main(){
	int w,h,m,n;
	cin>>w>>h>>m>>n;
	int x[m+1]={},y[n+1]={};
	int a,b=0;
	for(int i=0;i<m;i++){
		cin>>a;
		x[i] = a-b;
		b=a;
	}
	x[m] = w-b;
	b=0;
	for(int i=0;i<n;i++){
		cin>>a;
		y[i] = a-b;
		b=a;
	}
	y[n] = h-b;
	int xone=0,xtwo=0,yone=0,ytwo=0,temp;
	for(int i=0;i<m;i++){
		for(int j=0;j<m-i;j++){
			if(x[j] < x[j+1]){
				temp = x[j];
				x[j] = x[j+1];
				x[j+1] = temp;
			}
		}
	}
	xone = x[0];
	xtwo = x[1];
	for(int i=0;i<n;i++){
		for(int j=0;j<n-i;j++){
			if(y[j] < y[j+1]){
				temp = y[j];
				y[j] = y[j+1];
				y[j+1] = temp;
			}
		}
	}
	yone = y[0];
	ytwo = y[1];
	//compare
	int max = 0,lower = 0;
	int last[4] = {xone*yone,xone*ytwo,xtwo*yone,xtwo*ytwo};
	for(int i=0;i<4-1;i++){
		for(int j=0;j<4-1-i;j++){
			if(last[j] < last[j+1]){
				temp = last[j];
				last[j] = last[j+1];
				last[j+1] = temp;
			}
		}
	}
	cout<<last[0]<<" "<<last[1];
	return 0;
}