坐标排序

code:

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
using namespace std;
struct node
{
int a;
int b;
int c;
}p[10000];
bool cmp(node x,node y)
{
if(x.a==y.a)
{
return x.b<y.b; if(x.b==y.b) {
 return x.c<y.c; 
 	 }
  }
  return x.a<y.a; 
}
int main() { 
int n,k,i; 
while(cin>>n)
{
for(i=0;i<n;i++) { 
cin>>p[i].a;
cin>>p[i].b;
cin>>p[i].c;
}
cin>>k;
sort(p,p+n,cmp);
for(i=0;i<n;i++)
{
if(i==k-1)
{
cout<<p[i].a<<" "<<p[i].b<<" "<<p[i].c<<endl;
break;
}
}
}
return 0;
}