나이순 정렬

#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;

bool compare(pair<int, string> a, pair<int, string> b) {
	return a.first < b.first;
}
int main() {
	//freopen("input.txt", "rt", stdin);
	int n;
	scanf("%d", &n);
	vector<pair<int, string> > p;
	int a;
	string b;
	for (int i = 0; i < n; i++) {
		cin >> a >> b;
		p.push_back(make_pair(a, b));
	}

	stable_sort(p.begin(), p.end(), compare);

	for (int i = 0; i < n; i++) {
		cout << p[i].first << ' ' << p[i].second << '\n';
	}
	

	return 0;
}