1137 Final Grading (25分)

需要注意对小数转换成整数的处理,此处应该用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;
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值