PATA1133题解

排序题

//
//  main.cpp
//  PATA1133
//
//  Created by Phoenix on 2018/2/26.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100010;

struct Node {
    int data;
    int address;
    int next;
    int flag;
    int num;
}node[maxn];

bool cmp(Node a, Node b) {
    if(a.flag != b.flag) return a.flag > b.flag;
    else return a.num < b.num;
}


int main(int argc, const char * argv[]) {
    int begin, n, k;
    scanf("%d %d %d", &begin, &n, &k);
    for(int i = 0; i < n; i++) {
        int add;
        scanf("%d", &add);
        scanf("%d %d", &node[add].data, &node[add].next);
        node[add].address = add;
    }
    int num1 = 0, num2 = 0, num3 = 0, num = 0;
    while (begin != -1) {
        num++;
        if(node[begin].data < 0) {
            node[begin].flag = 3;
            node[begin].num = num1++;
        } else if(node[begin].data >= 0 && node[begin].data <= k) {
            node[begin].flag = 2;
            node[begin].num = num2++;
        } else {
            node[begin].flag = 1;
            node[begin].num = num3++;
        }
        begin = node[begin].next;
    }
    sort(node, node + maxn, cmp);
    for(int i = 0; i < num; i++) {
        if(i != num - 1) printf("%05d %d %05d\n", node[i].address, node[i].data, node[i+1].address);
        else printf("%05d %d -1\n", node[i].address, node[i].data);
    }
    return 0;
}