알고리즘/BOJ
[11651번] 좌표정렬하기2
남현경
2018. 7. 26. 23:33
#include#include using namespace std; int N; pair p[100001]; int main() { cin >> N; for (int i = 0; i < N; i++) { cin >> p[i].second >> p[i].first; } sort(p, p + N); for (int i = 0; i < N; i++) { cout << p[i].second << " " << p[i].first << "\n"; } return 0; }