题解 | #找最小数#

#include <stdio.h>

typedef struct{
    int x;
    int y;
}Point;

int main() {
    int n;
    scanf("%d", &n);
    Point *point;
    point = (Point*) malloc(sizeof(Point) * n);
    int i;
    for(i = 0; i < n; i++){
        scanf("%d %d", &point[i].x, &point[i].y);
    }
    int min = 0;
    for(i = 1; i < n; i++){
        if(point[i].x < point[min].x){
            min = i;
        }
    }
    for(i = 0; i < n; i++){
        if(point[i].x == point[min].x){
            if(point[i].y < point[min].y){
                min = i;
            }
        }
    }
    printf("%d %d\n", point[min].x, point[min].y);
    return 0;
}