1137 Final Grading (25分)

最新推荐文章于 2024-06-13 17:48:22 发布

原创最新推荐文章于 2024-06-13 17:48:22 发布 · 222 阅读

0 ·

CC 4.0 BY-SA版权

编程练习同时被 2 个专栏收录

93 篇文章

订阅专栏

PAT

87 篇文章

订阅专栏

本文介绍了一个学生成绩管理系统的设计与实现，该系统使用C++语言，通过输入学生的编程、期中和期末成绩，计算总评成绩，并根据成绩判断是否及格，最后按及格状态和成绩对学生进行排序并输出。

需要注意对小数转换成整数的处理，此处应该用round()。

#include<cstdio>
#include<vector>
#include<algorithm>
#include<iostream>
#include<string>
#include<map>
#include<cmath>

#define maxn 100000
using namespace std;

struct studentType {
    string name;
    int p, m, f, g;  // programming, mid-term, final exam, grade
    bool pass;
} student[maxn];

int stuNum = 0;
map<string, int> mp;

int check_exit(string s) {
    if (mp.count(s) == 0) {
        mp[s] = stuNum;
        student[stuNum].name = s;
        student[stuNum].p = student[stuNum].m = student[stuNum].f = student[stuNum].g = -1;
        stuNum++;
    }
    return mp[s];
}

bool compare(studentType a, studentType b) {
    if (a.pass != b.pass) {
        if (a.pass) return true;
        else return false;
    }
    if (a.g != b.g) return a.g > b.g;
    else return a.name < b.name;
}

int main() {
    int P, M, N;
    scanf("%d %d %d", &P, &M, &N);
    string name;
    int stu, grade;
    while(P--) {
        cin >> name >> grade;
        stu = check_exit(name);
        if (student[stu].p == -1) student[stu].p = 0;
        student[stu].p += grade;
    }
    while(M--) {
        cin >> name >> grade;
        stu = check_exit(name);
        if (student[stu].m == -1) student[stu].m = 0;
        student[stu].m += grade;
    }
    while(N--) {
        cin >> name >> grade;
        stu = check_exit(name);
        if (student[stu].f == -1) student[stu].f = 0;
        student[stu].f += grade;
    }
    for (int i = 0; i < stuNum; i++) {
        if (student[i].m > student[i].f) {
            double d = (student[i].m * 0.4 + student[i].f * 0.6);
            student[i].g = round(d);
        }
        else student[i].g = student[i].f;
        if (student[i].p >= 200 && student[i].g >= 60) student[i].pass = true;
        else student[i].pass = false;
    }
    sort(student, student + stuNum, compare);
    for (int i = 0; i < stuNum; i++) {
        studentType temp = student[i];
        if (temp.pass == false) break;
        cout << temp.name << ' ' << temp.p << ' ' << temp.m << ' ' << temp.f << ' ' << temp.g << endl;
    }

    return 0;
}