Submission

Score: 65

User: Prap

Problemset: ขนมปัง

Language: cpp

Time: 0.005 second

Submitted On: 2026-04-07 20:02:11

#include <iostream>
#include <cmath>
#include <string>
#include <vector>
using namespace std;
int main() {
    int W,H,M,N;
    cin>>W>>H>>M>>N;
    int nig[M+2], gga[N+2];
    int nick[M+1],gra[N+1];
	int hol;
    for (int i = 0; i<M; i++) {
        cin>>nig[i];
    }
    nick[0] = nig[0];
    for (int i = 0; i<N; i++) {
        cin>>gga[i];
    }
    gra[0] = gga[0];
    int sumni = 0;
    for (int i = 1; i<M; i++) {
        nick[i] = nig[i] - nig[i-1];
        sumni+=nick[i];
    }
    nick[M] = W - sumni - nick[0];
    int sumnic = 0;
    for (int i = 1; i<N; i++) {
        gra[i] = gga[i] - gga[i-1];
        sumnic+=gga[i];
    }
    gra[N] = H - sumnic - gra[0];
    int max = 0, maxy = 0;
    int ngga[M+1][N+1];
    for (int i = 0; i<=M; i++) {
    	for(int j = 0;j<=N;j++) {
    		ngga[i][j] = nick[i]*gra[j];
    		if (ngga[i][j] == max) {
    			maxy = max;
			}
			else if (ngga[i][j] > max) {
				maxy = max;
				max = ngga[i][j];
			}
			else if (ngga[i][j] > maxy) {
				maxy = ngga[i][j];
			}
		}
	}
	cout<<max<<" "<<maxy;
	return 0;
}