View Code of Problem 83

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<climits>
#include<cmath>
#include<unordered_map>
#include<set>

using namespace std;

bool cmp(pair<double, double> a, pair<double, double> b) {

	return a.first < b.first;
}

int main()
{
	int n, m;

	
	while (cin >> n >> m) {

		vector<pair<double, double>> res;

		for (int i = 0; i < n + m; i++) {

			double id;
			double grade;
			cin >> id >> grade;

			res.push_back(make_pair(id, grade));
		}
		
		sort(res.begin(), res.end(), cmp);

		for (int i = 0; i < res.size(); i++)
			cout << res[i].first << " " << res[i].second << endl;
	}
}