View Code of Problem 83

#include <iostream>
#include <algorithm>
using namespace std;
typedef struct{
	int num;
	int p;
}student; 
bool cmp(student a,student b){
	return a.num<b.num;
}
int main(){
	int m,n;
	cin>>m>>n;
	student s[m+n];
	for(int i=0;i<(m+n);i++){
		cin>>s[i].num>>s[i].p;
	}
	sort(s,s+m+n,cmp);
	for(int i=0;i<(m+n);i++){
		cout<<s[i].num<<" "<<s[i].p<<endl;
	}
}