【POJ1581】A Contesting Decision（简单模拟）

没有什么弯路，直接模拟即可。水题。

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <cctype>
#include <algorithm>
#include <numeric>
using namespace std;

struct team {
    string name;
    int submit[4], time[4];
    int ac , time_all ;
    void setTeam (string n, int s1, int t1, int s2, int t2, int s3, int t3, int s4, int t4) {
        name = n;
        ac = 0; time_all = 0;
        submit[0] = s1; time[0] = t1;
        submit[1] = s2; time[1] = t2;
        submit[2] = s3; time[2] = t3;
        submit[3] = s4; time[3] = t4;
        for (int i = 0; i < 4; ++ i) {
            if (submit[i] > 0 && time[i] > 0) {
                ac ++;
                time_all += time[i] + 20 * (submit[i] - 1 );
            }
        }
    }
};

bool cmp (team a, team b) {
    if (a.ac != b.ac) {
        return a.ac > b.ac;
    } else {
        return a.time_all < b.time_all;
    }
}

int main () {
    ios :: sync_with_stdio(false);
    int n; team Team[100];
    string name; int s1, s2, s3, s4, t1, t2, t3, t4;
    while (cin >> n) {
        for (int i = 0; i < n; ++ i) {
            cin >> name >> s1 >> t1 >> s2 >> t2 >> s3 >> t3 >> s4 >> t4;
            Team[i].setTeam(name, s1, t1, s2, t2, s3, t3, s4, t4);
        }
        sort (Team, Team + n, cmp);
        cout << Team[0].name << " " << Team[0].ac << " " << Team[0].time_all << endl;
    }
    return 0;
}