Submission

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

Score: 100

User: Mii

Problemset: ขนมปัง

Language: cpp

Time: 0.036 second

Submitted On: 2024-11-24 21:55:02

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
  int H,W,x,y,tmp;
  cin>>H>>W>>x>>y;
  vector<int> vx={0},vy={0},ans;
  for(int i=0;i<x;i++){
    cin>>tmp;
    vx.push_back(tmp);
  }
  vx.push_back(H);
  for(int i=0;i<y;i++){
    cin>>tmp;
    vy.push_back(tmp);
  }
  vy.push_back(W);
  for(int i=1;i<vx.size();i++){
    for(int j=1;j<vy.size();j++){
      ans.push_back((vy[j]-vy[j-1])*(vx[i]-vx[i-1]));
    }
  }
  sort(ans.begin(),ans.end());
  cout<<ans[ans.size()-1]<<' '<<ans[ans.size()-2];
}