PATA1062学生排序算法-优快云博客

本文介绍了一个用于对学生进行多条件排序的C++程序实现，该程序基于特定的成绩标准筛选并排序学生信息，最终输出排序后的学生名单。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

排序题

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

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 100010;
int n, l, h, k = 0;

struct Student {
    int id, talent, virtue;
    int total, flag;
}stu[maxn];

bool cmp(Student a, Student b) {
    if(a.flag != b.flag) return a.flag < b.flag;
    else if(a.total != b.total) return a.total > b.total;
    else if(a.virtue != b.virtue) return a.virtue > b.virtue;
    else return a.id < b.id;
}

int main(int argc, const char * argv[]) {
    scanf("%d %d %d", &n, &l, &h);
    for(int i = 0; i < n; i++) {
        int id, talent, virtue, flag;
        scanf("%d %d %d", &id, &virtue, &talent);
        if(talent >= l && virtue >= l) {
            stu[k].id = id;
            stu[k].talent = talent;
            stu[k].virtue = virtue;
            stu[k].total = talent + virtue;
            if(talent >= h && virtue >= h) flag = 1;
            else if(virtue >= h && talent >= l) flag = 2;
            else if(virtue >= l && virtue >= talent) flag = 3;
            else flag = 4;
            stu[k].flag = flag;
            k++;
        }
    }
    sort(stu, stu + k, cmp);
    printf("%d\n", k);
    for(int i = 0; i < k; i++) {
        printf("%08d %d %d\n", stu[i].id, stu[i].virtue, stu[i].talent);
    }
    return 0;
}

PATA1062题解