[백준 10814번] 나이순 정렬 (Stable_sort)

stable_sort : 굳이 정렬이 필요없는 경우 입력 순서를 보장함

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;

vector<pair<int, string>> v;
bool compare(pair<int, string> a, pair<int, string> b) {
	return (a.first < b.first);
}
int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
	int N;
	cin >> N;
	for (int i = 0; i < N; i++)
	{
		int temp_i;
		string temp_s;
		cin >> temp_i >> temp_s;
		v.push_back({ temp_i, temp_s });
		
	}
	stable_sort(v.begin(), v.end(),compare);
	for (int i = 0; i < v.size(); i++)
	{
		cout << v[i].first << " " << v[i].second << '\n';
	}

}