1080. MOOC期终成绩 (25)

一、题目

输入样例：
6 6 7
01234 880
a1903 199
ydjh2 200
wehu8 300
dx86w 220
missing 400
ydhfu77 99
wehu8 55
ydjh2 98
dx86w 88
a1903 86
01234 39
ydhfu77 88
a1903 66
01234 58
wehu8 84
ydjh2 82
missing 99
dx86w 81
输出样例：
missing 400 -1 99 99
ydjh2 200 98 82 88
dx86w 220 88 81 84
wehu8 300 55 84 84

二、个人理解

Tips：

• 采用map保存信息，比较容易连接
• 排序可以采用结构体排序
• map中实现的一个细节地方：期中成绩若不存在，如果你不用find，而是直接用m[“asd”]会插入一个m[“asd”]=0

C++：

#include <iostream>
#include <cstdlib>
#include <map>
using namespace std;

map<string, int> m1;//编程表
map<string, int> m2;//期中表
map<string, int> m3;//期末表

typedef struct {
    string number;
    int score_code;
    int score_mid;
    int score_final;
    int score;//最终成绩
} student;

//比较函数
int cmp(const void * a, const void * b)
{
    student *c = (student *)a;
    student *d = (student *)b;
    if (c->score == d->score) { //分数降序
        return c->number > d->number;
    } else {    //名字按字母序
        return c->score < d->score;
    }
}

student s[10000];

int main()
{
    int p, m, n;
    cin >> p >> m >> n;
    string number;
    int score;
    //输入三张表
    for (int i = 0; i < p; i++) {
        cin >> number >> score;
        m1.insert(make_pair(number, score));
    }
    for (int i = 0; i < m; i++) {
        cin >> number >> score;
        m2.insert(make_pair(number, score));
    }
    for (int i = 0; i < n; i++) {
        cin >> number >> score;
        m3.insert(make_pair(number, score));
    }
    int cnt = 0;//记录有效人数
    for (map<string, int> :: iterator iter = m1.begin(); iter != m1.end(); iter++) {
        if (iter->second >= 200) {//第一个条件，编程分大于200
            int temp_score;
            if (m2.find(iter->first) == m2.end()) {//如果没有期中分，将其置为-1
                s[cnt].score_mid = -1;
                temp_score = m3[iter->first];
            } else {
                if (m2[iter->first] > m3[iter->first] ) {
                    temp_score = int(m2[iter->first] * 0.4 + m3[iter->first] * 0.6 + 0.5) ;//注意四舍五入
                } else {
                    temp_score = m3[iter->first];
                }
                s[cnt].score_mid = m2[iter->first];
            }
            if (temp_score >= 60) {//及格，有效人数cnt++
                s[cnt].number = iter->first;
                s[cnt].score_code = iter->second;
                s[cnt].score_final = m3[iter->first];
                s[cnt].score = temp_score;
                cnt++;
            }
        }
    }
    qsort(s, cnt, sizeof(student), cmp);//排序
    for (int i = 0; i < cnt; i++) {
        cout << s[i].number << " " << s[i].score_code << " " << s[i].score_mid << " " << s[i].score_final << " " << s[i].score << endl;
    }
}