题解 | #使用排序的做法求最小数#

#include <stdio.h>
struct Num{
    int x;
    int y;
}nums[1000];

int cmp(struct Num*a,struct Num*b){
    if(a->x==b->x){
        return a->y-b->y;
    }
    else{
        return a->x-b->x;
    }
}

int main() {
    int n;
    while(scanf("%d",&n)!=EOF){
        for(int i=0;i<n;i++){
            scanf("%d %d",&nums[i].x,&nums[i].y);
        }
        qsort(nums,n,sizeof(nums[0]),cmp);
        printf("%d %d",nums[0].x,nums[0].y);
    }
    return 0;
}