编写题解 1052: [编程入门]链表合并

解题思路:

注意事项:

参考代码://
// Created by ch'li'sen on 2022/3/8.
//

#include<iostream>
#include "algorithm"
using namespace std;
typedef struct{
   int id;
   int score;
}student;
bool cmp(student a,student b){
   return a.id <b.id;
}
int main()
{
   int n,m;
   cin>>n>>m;
   student s[n+m];
   for (int i = 0; i < n+m; ++i) {
       cin>>s[i].id>>s[i].score;
   }
   sort(s,s+n+m,cmp);
   for (int i = 0; i < n+m; ++i) {
      cout<<s[i].id<<" "<<s[i].score<<"\n";
   }
  return 0;
}