题目：https://pintia.cn/problem-sets/994805260223102976/problems/994805262953594880

用了很多属性，虽然复杂但是不难

代码

  1. #include<cstdio>
  2. #include<algorithm>
  3. using namespace std;
  4. const int maxn = 100010;
  5. struct Node{
  6.     int add, data, next;
  7.     int level, seq;
  8.     bool flag;
  9. }node[maxn];
  11. bool cmp(Node a, Node b){
  12.     if(a.flag == false || b.flag == false) return a.flag > b.flag;
  13.     else if(a.level != b.level) return a.level < b.level;
  14.     else return a.seq < b.seq;
  15. }
  17. int main(){
  18.     for(int i = 0; i < maxn; i++){
  19.         node[i].flag = false;
  20.     }
  21.     int frist, n, k;
  22.     scanf("%d%d%d", &frist, &n, &k);
  23.     int temp_add;
  24.     for(int i = 0; i < n; i++){
  25.         scanf("%d", &temp_add);
  26.         node[temp_add].add = temp_add;
  27.         scanf("%d%d", &node[temp_add].data, &node[temp_add].next);
  28.         if(node[temp_add].data < 0) node[temp_add].level = 1;
  29.         else if(node[temp_add].data <= k) node[temp_add].level = 2;
  30.         else node[temp_add].level = 3;
  31.     }
  32.     int p = frist, count = 0;
  33.     while(p != -1){
  34.         node[p].flag = true;
  35.         node[p].seq = count;
  36.         p = node[p].next;
  37.         count++;
  38.     }
  39.     sort(node, node + maxn, cmp);
  40.     for(int i = 0; i < count; i++){
  41.         printf("%05d %d ", node[i].add, node[i].data);
  42.         if(i != count - 1) printf("%05d\n", node[i + 1].add);
  43.         else printf("-1\n");
  44.     }
  45. }