View Code of Problem 83

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef struct node{
    int number;
    double score;
}stu[1000];

bool cmp(node a,node b){
    return a.number<b.number;
}

int main(){
    int n,m;
    int j = 0;
    node stu1[100];
    node stu2[100];
    scanf("%d %d",&n,&m);
    for(int i=0;i<n;i++)
        scanf("%d %lf",&stu1[i].number,&stu1[i].score);
    for(int i=0;i<m;i++)
        scanf("%d %lf",&stu2[i].number,&stu2[i].score);
    for(int i=n;i<n+m;i++){
        stu1[i].number = stu2[j].number;
        stu1[i].score = stu2[j].score;
        j++;
    }
    sort(stu1,stu1+n+m,cmp);
    for(int i=0;i<n+m;i++)
        printf("%d %lf\n",stu1[i].number,stu1[i].score);
    return 0;
}

Double click to view unformatted code.


Back to problem 83