View Code of Problem 83

#include<cstdlib>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
struct node
{
		int a,b;
}s[100];
int cmp(node a,node b)
{
   return a.a<b.a;
}
int main(){
    int n,m,i;
	scanf("%d%d",&n,&m);
	for( i=0;i<n;i++)
	{
			scanf("%d%d",&s[i].a,&s[i].b);
	}
	for( i=n;i<m+n;i++)
	{
			scanf("%d%d",&s[i].a,&s[i].b);
	}
	sort(s,s+m+n,cmp);
	for(i=0;i<m+n;i++)
	{
			printf("%d %d\n",s[i].a,s[i].b);
	}
	return 0;
}