Submission

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

Score: 100

User: solarsunny

Problemset: ขนมปัง

Language: cpp

Time: 0.002 second

Submitted On: 2025-03-31 15:52:18

#include <bits/stdc++.h>
using namespace std;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int w,h,m,n = 0;
    cin >> w >> h >> m >> n;
    int shor[m+1];
    int prevh=0;
    for(int i=0; i<m; i++) {
        int hi;
        cin >> hi;
        shor[i] = hi-prevh;
        prevh= hi;
    }
    shor[m] = w-prevh;

    int sver[n+1];
    int prevv=0;
    for(int i=0; i<n; i++) {
        int vi;
        cin >> vi;
        sver[i] = vi-prevv;
        prevv= vi;
    }
    sver[n] = h-prevv;

    sort(shor,shor+m+1);
    sort(sver,sver+n+1);
    
    int t[4];
    t[0] = shor[m]*sver[n];
    t[1] = shor[m]*sver[n-1];
    t[2] = shor[m-1]*sver[n];
    t[3] = shor[m-1]*sver[n-1];
    sort(t,t+4);
    cout << t[3] << " " << t[2] << endl;
    
}