정렬_백준_좌표 정렬하기_11651

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
 
struct Point {
    int x, y;
};
 
bool cmp(const Point & u, const Point & v) {
    if (u.y < v.y) {
        return true;
    }
    else if (u.y == v.y) {
        if (u.x < v.x) {
            return true;
        }
    }
    return false;
}
int main() {
    int n;
    cin >> n;
    vector <Point> value(n);
    for (int i = 0; i < n; i++) {
        scanf("%d %d", &value[i].x, &value[i].y);
    }
    sort(value.begin(), value.end(), cmp);
    for (int i = 0; i < n; i++) {
        printf("%d %d\n", value[i].x, value[i].y);
    }
}