#include <cstdio>
#include <cstring>
#include <queue>
#include <iostream>
#include <algorithm>
using namespace std;
const int N=200;
int dp[N];
struct node{
int x,y,z;
node() {}
node(int a, int b, int c): x(a), y(b), z(c) {}
bool operator > (node &other) const
{
return (x>other.x && y>other.y);
}
}v[N];
bool cmp(const node &a, const node &b){
return ( a.x>b.x || (a.x==b.x && a.y&g......
阅读全文