这真是很玄学的一道题,贪心也要贪好几次。。。
题解:http://blog.csdn.net/snowy_smile/article/details/50774455
题解:http://blog.csdn.net/imwutianqi/article/details/50895167
#include<bits/stdc++.h>
#define ll long long
using namespace std;
struct node{
int a,b;
}x[100005];
struct node2{
int a,b,c;
}y[100005],z[100005];
int vis[100005];
int cmp1(node a,node b){
if(a.b!=b.b)
return a.b<b.b;
return a.a<b.a;
}
int cmp2(node2 a,node2 b){
if(a.b!=b.b)
return a.b<b.b;
if(a.a!=b.a)
return a.a<b.a;
return a.c<b.c;
}
int cmp3(node2 a,node2 b){
if(a.a!=b.a)
return a.a<b.a;
if(a.b!=b.b)
return a.b<b.b;
return a.c<b.c;
}
struct cmp{
bool o