View Code of Problem 83

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