新手请教大佬
查看原帖
新手请教大佬
225837
jimmyshi29楼主2020/8/12 20:41
# include <iostream>
# include <string>
# include <algorithm>
using namespace std;

int n;

struct Peo
{
    string ming;
    int qi_muo, ban_ji, lun_wen, jiang_xue_jin = 0;
    char xi_bu, gan_bu;
    void read()
    {
        cin >> ming >> qi_muo >> ban_ji >> gan_bu >> xi_bu >> lun_wen;
    }
    void print()
    {
        cout << ming << endl << jiang_xue_jin;
    }
};

Peo a[105];

bool cmp(Peo x, Peo y)
{
    return x.jiang_xue_jin > y.jiang_xue_jin;
}

int main()
{
    cin >> n;
    int mx = -1;
    for (int i = 1; i <= n; i++)
    {
        a[i].read();
        if (a[i].qi_muo > 80 && a[i].lun_wen > 0) a[i].jiang_xue_jin += 8000;
        if (a[i].qi_muo > 85 && a[i].ban_ji > 80) a[i].jiang_xue_jin += 4000;
        if (a[i].qi_muo > 90) a[i].jiang_xue_jin += 2000;
        if (a[i].qi_muo > 85 && a[i].xi_bu == 'Y') a[i].jiang_xue_jin += 1000;
        if (a[i].ban_ji > 80 && a[i].gan_bu) a[i].jiang_xue_jin += 850;
    }
    sort (a + 1, a + n + 1, cmp);
    a[1].print();
    cout << endl;
    int sum = 0;
    for (int i = 1; i <= n; i++)
    {
        sum += a[i].jiang_xue_jin;
    }
    cout << sum << endl;
    return 0;
}

0分,请大佬看看

2020/8/12 20:41
加载中...