Submission

[PPPP][PPPP][PPPP][PPPP][PPPP][PPPP][PPPP][PPPP]

Score: 100

User: akuyga1

Problemset: ขนมปัง

Language: cpp

Time: 0.002 second

Submitted On: 2025-02-26 11:15:25

#include "bits/stdc++.h"
using namespace std;
#define ii pair<int,int>
#define f first
#define s second
#define mp make_pair


int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int W,H,N,K;
	cin>>W>>H>>N>>K;
	vector<int> A(N+2),B(K+2);
	A[0]=0; A[N+1]=W;
	for(int i=1;i<=N;i++)cin>>A[i];
	B[0]=0; B[K+1]=H;
	for(int i=1;i<=K;i++)cin>>B[i];
	int mx1=0,mx2=0,my1=0,my2=0;
	sort(A.begin(),A.end());
	sort(B.begin(),B.end());
	for(int i=1;i<=N+1;i++){
	    if(A[i]-A[i-1]>=mx1){mx2=mx1; mx1=A[i]-A[i-1];}
	    else if(A[i]-A[i-1]>mx2){mx2=A[i]-A[i-1];}
	}
	for(int i=1;i<=K+1;i++){
	    if(B[i]-B[i-1]>=my1){my2=my1; my1=B[i]-B[i-1];}
	    else if(B[i]-B[i-1]>my2){my2=B[i]-B[i-1];}
	}
	vector<int> ans;
	ans.push_back(mx1*my1);
	ans.push_back(mx1*my2);
	ans.push_back(mx2*my1);
	sort(ans.begin(),ans.end());
	cout<<ans[2]<<' '<<ans[1];
}