View Code of Problem 83

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef struct{
    int num;
    int score;
}student;
int compare(const void*c,const void*d){
    return (*(student*)c).num-(*(student*)d).num;
}
int main()
{
	int n,m;
	scanf("%d %d",&n,&m);
	student a[n+m];
	student b[m];
	//student c[n+m];
	int i;
	for(i = 0;i < n;i++){
        scanf("%d %d",&a[i].num,&a[i].score);
	}
	for(i = 0;i < m;i++){
        scanf("%d %d",&b[i].num,&b[i].score);
	}
	int k = 0;
	for(i = n;i < n+m;i++){
        a[i].num = b[k].num;
        a[i].score = b[k].score;
        k++;
	}
	qsort(a,n+m,sizeof(student),compare);
	for(i = 0;i < n+m;i ++){
        printf("%d %d\n",a[i].num,a[i].score);
	}
	return 0;
}