View Code of Problem 83

#include<stdio.h>

typedef struct num
{
	int num;
	int score;
}num;
void mergeAndsort(num stu1[],num stu2[],int m,int n)
{
	int i,j,temp,temp2;
	for(j=0,i=m;i<m+n;i++,j++)
	{
		stu1[i].num = stu2[j].num;
		stu1[i].score = stu2[j].score;
	}
	for(i=0;i<m+n;i++)
	{
		for(j=i+1;j<m+n;j++)
		{
			if(stu1[i].num>stu1[j].num)
			{
				temp = stu1[i].num;
				stu1[i].num = stu1[j].num;
				stu1[j].num = temp;
				temp2 = stu1[i].score;
				stu1[i].score = stu1[j].score;
				stu1[j].score = temp2;
			}
		}
	}
	for(i=0;i<m+n;i++)
	{
		printf("%d %d\n",stu1[i].num,stu1[i].score);
	}
}
int main()
{
	num stu1[100],stu2[100];
	int m,n;
	scanf("%d %d",&m,&n);
	int i,j;
	for(i=0;i<m;i++)
	{
		scanf("%d %d",&stu1[i].num,&stu1[i].score);
	}
	for(j=0;j<n;j++)
	{
		scanf("%d %d",&stu2[j].num,&stu2[j].score);
	}
	mergeAndsort(stu1,stu2,m,n);
	return 0;
}

Double click to view unformatted code.


Back to problem 83