题解

https://www.acgo.cn/application/1949416793793445888尊敬的同学，您能加入我的团队嘛？给您发邀请啦，期待您的加入[微笑]

#include<bits/stdc++.h>  
using namespace std;  
struct student
{
    string name;  
    int n;  
    int pj,py; 
    char c, d;  
    int lw;
    int money = 0;  
} a[110];  
bool cmp(student a, student b)
{
    if (a.money != b.money)  
        return a.money > b.money;  
    else 
        return a.n < b.n;  
}
int main()
{
    int n;  
    cin >> n;  
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].name >> a[i].pj >> a[i].py >> a[i].c >> a[i].d >> a[i].lw;  
        a[i].n = i;  
    }
    for (int i = 1; i <= n; i++)
    {
        if (a[i].pj > 80 && a[i].lw >= 1) 
            a[i].money += 8000;  
        if (a[i].pj > 85 && a[i].py > 80)  
            a[i].money += 4000; 
        if (a[i].pj > 90)  
            a[i].money += 2000; 
        if (a[i].pj > 85 && a[i].d == 'Y')  
            a[i].money += 1000; 
        if (a[i].py > 80 && a[i].c == 'Y') 
            a[i].money += 850;
    }
    sort(a + 1, a + n + 1, cmp);
    int cnt = 0;
    cout << a[1].name << endl; 
    cout << a[1].money << endl;  
    for (int i = 1; i <= n; i++)
        cnt += a[i].money;
    cout << cnt;

    return 0; 
}