View Code of Problem 83

#include<bits/stdc++.h>
using namespace std;


struct stu{
	int id;
	int grade;

};
int cmp(stu a, stu b) {
	return a.id < b.id;
}

int main() {
	int n,m;
	stu a[105], b[105];
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		cin >> a[i].id >> a[i].grade;
	}
	for (int i = 0; i < m; i++) {
		cin >> b[i].id >> b[i].grade;
	}
	for (int i = n; i < m + n; i++) {
		a[i].id = b[i - n].id;
		a[i].grade = b[i - n].grade;
	}
	sort(a, a + m + n, cmp);
	for (int i = 0; i < m + n; i++) {
		cout << a[i].id << " " << a[i].grade << endl;
	}

	
	
	return 0;
}