View Code of Problem 83

#include <stdio.h>

typedef struct node{
    int n,score;
}node;

int comp(const void* a,const void* b)
{
    node* c = (node*)a;
    node* d = (node*)b;
    return c->n - d->n;
}

int main(void)
{
    int m,n,i;
    while(scanf("%d%d",&m,&n) != EOF)
    {
        node stu[100];
        for(i = 0;i < m + n;i++)
        {
            scanf("%d%d",&stu[i].n,&stu[i].score);
        }
        qsort(stu,m+n,sizeof(node),comp);
        for(i = 0;i < m + n;i++)
            printf("%d %d\n",stu[i].n,stu[i].score);
    }
    return 0;
}