View Code of Problem 83

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <cmath>
#include <algorithm>
using namespace std;
#pragma warning(disable:4996)


struct Student {
		int id;
		int goal;
};

int main() {
	Student stu[1000];
	int n, m;
	scanf("%d %d", &n, &m);
	for (int i = 0; i < n + m; i++) {
		scanf("%d %d", &stu[i].id, &stu[i].goal);
	}
	for (int j = 0; j <= m + n - 2; j++) {
		for (int i = n + m - 1; i >= j+1; i--) {
			if (stu[i].id < stu[i - 1].id) {
				swap(stu[i].id, stu[i - 1].id);
				swap(stu[i].goal, stu[i - 1].goal);
			}
		}
	}
	for (int i = 0; i < n + m; i++) {
		printf("%d %d\n", stu[i].id, stu[i].goal);
	}
	return 0;
}