View Code of Problem 83

#include <stdio.h>
#include <string.h>
struct node
{
	int id;
	int socre;
};
int main()
{
	int n,m,t,k;
	scanf("%d%d",&n,&m);
	int sum=n+m;
	struct node s[sum];
	for(int i=0;i<sum;++i)
	{
		scanf("%d %d",&s[i].id,&s[i].socre);
	}
	for(int i=0;i<sum;++i)
	{
		for(int j=0;j<sum;++j)
		{
			if(s[j].id>s[j+1].id)
			{
				t=s[j].id;
				s[j].id=s[j+1].id;
				s[j+1].id=t;
				
				k=s[j].socre;
				s[j].socre=s[j+1].socre;
				s[j+1].socre=k;
				
				
			}
		}
	}
	
	
	for(int i=0;i<sum;++i)
	{
		printf("%d %d\n",s[i].id,s[i].socre);
	}

	return 0;
}