PAT-A1083-List Grades

PAT List Grades - 题目链接


题目描述

 Given a list of N student records with name, ID and grade. You are supposed to sort the records with respect to the grade in non-increasing order, and output those student records of which the grades are in a given interval.

输入描述

 Each input file contains one test case. Each case is given in the following format:
  N
  name[1] ID[1] grade[1]
  name[2] ID[2] grade[2]
  … …
  name[N] ID[N] grade[N]
  grade1 grade2
  where name[i] and ID[i] are strings of no more than 10 characters with no space, grade[i] is an integer in [0, 100], grade1 and grade2 are the boundaries of the grade’s interval. It is guaranteed that all the grades are distinct.

输出描述

 For each test case you should output the student records of which the grades are in the given interval [grade1, grade2] and are in non-increasing order. Each student record occupies a line with the student’s name and ID, separated by one space. If there is no student’s grade in that interval, output NONE instead.


示例:

输入

4
Tom CS000001 59
Joe Math990112 89
Mike CS991301 100
Mary EE990830 95
60 100

输出

Mike CS991301
Mary EE990830
Joe Math990112


输入

2
Jean AA980920 60
Ann CS01 80
90 95

输出

NONE


解题思路

 1.结构数组存取数据
 2.编写cmp函数
 3.按范围输出结果

参考代码

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

const int maxn = 100;

struct Student {
    char name[10];
    char id[20];
    int grade;
} Student[maxn];

bool cmp(struct Student a, struct Student b) {
    return a.grade > b.grade;
}

int main() {
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; ++i) {
        scanf("%s %s %d", Student[i].name, Student[i].id, &Student[i].grade);
    }
    int low, high;
    scanf("%d%d", &low, &high);
    sort(Student, Student + n, cmp);
    bool isPrint = false;
    for (int i = 0; i < n; ++i) {
        if (Student[i].grade >= low && Student[i].grade <= high) {
            printf("%s %s\n", Student[i].name, Student[i].id);
            isPrint = true;
        }
    }
    if (!isPrint) {
        printf("NONE\n");
    }
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值