[백준 11650] 좌표 정렬하기 (C++)

#include <bits/stdc++.h>
#define FASTIO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define INF 2147483646
using namespace std;
typedef pair<int, int>pii;

vector<pii> point;
vector<pii> ptr;
int N;
bool compare(pii a , pii b) {
	if (a.first == b.first)
		return a.second < b.second;
	else
		return a.first < b.first;
}

int main() {
	FASTIO;
	int a, b;
	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> a >> b;
		point.push_back({ a,b });

	}
	sort(point.begin(), point.end(), compare);
	for (int i=0; i <point.size(); i++) {
		cout << point[i].first << " " << point[i].second << "\n";
	}
}

vector 와 pair 와 sort를 연습하기 좋은 문제였다