백준 11650번 좌표 정렬하기

https://www.acmicpc.net/problem/11650

#include <iostream>
#include <algorithm>
using namespace std;
struct cood {
    int x, y;
};
cood arr[100001] = {0, };
bool compare (cood a, cood b) {
    return a.x != b.x ? a.x < b.x : a.y < b.y;
}
int main()
{
    int n;
    cin >> n;
    
    for (int i = 0; i < n; ++i) {
        scanf("%d %d", &arr[i].x, &arr[i].y);
    }
    
    sort(arr,  arr + n, compare);
    
    for (int i = 0; i < n; ++i) {
        printf("%d %d\n", arr[i].x, arr[i].y);
    }
    
    return 0;
}