Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cstdio>
- #include <algorithm>
- using namespace std;
- int asd[105][5];
- int a[210];
- int b[210];
- int main() {
- int x,y,n;
- scanf("%d %d", &x, &y);
- scanf("%d", &n);
- for(int i=0;i<n;i++) {
- scanf("%d %d", &asd[i][0], &asd[i][1]);
- if(asd[i][0]==0) {
- a[i]=asd[i][1];
- a[i+100]=y-asd[i][1];
- }
- if(asd[i][0]==1) {
- b[i]=asd[i][1];
- b[i+100]=x-asd[i][1];
- }
- }
- sort(&a[0], &a[201]);
- sort(&b[0], &b[201]);
- int maxa=0;
- int maxb=0;
- for(int i=200;i>0;i--) {
- if(a[i]>0) {
- maxa=a[i]-a[i-1];
- break;
- }
- }
- for(int i=200;i>0;i--) {
- if(b[i]>0) {
- maxb=b[i]-b[i-1];
- break;
- }
- }
- printf("%d", maxa*maxb);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement