http://ac.jobdu.com/problem.php?pid=1170
#include<stdio.h>
#include<stdlib.h>struct node{
int x;
int y;
}m[1005];
int cmp(const void *a, const void *b)
{
struct node c = *(struct node *)a;
struct node d = *(struct node *)b;
if(c.x==d.x) return c.y - d.y;
else return c.x - d.x;
}
int main()
{
int i,n;
while(scanf("%d",&n)!=EOF){
for(i=0;i<n;i++)scanf("%d %d",&m[i].x,&m[i].y);
qsort(m,n,sizeof(struct node),cmp);
printf("%d %d\n",m[0].x,m[0].y);
}
return 0;
}