hdu2093 考试排名（还需完善）

 下面代码是借鉴的。好多的知识点等着完善

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
struct stu
{
    string name;
    int time;
    int solved;
}S[10001];
bool cmp(stu a,stu b)
{
    return a.solved != b.solved ? a.solved > b.solved:a.time < b.time;
}
int main()
{
    int n, m, wa, time, d;
    string str;
    cin >> n >> m;
    d = 0;
    while (cin >> S[d].name)
    {
        S[d].time = 0;
        S[d].solved = 0;

        for (int j = 0; j < n;j++)
        {
            wa = 0;
            time = 0;
            cin >> str;
            if (str[0] == '0' || str[0] == '-')     // 如果没有AC，不处理
                continue;
            for (int k = 0; k < str.length();k++)
            {
                if(str[k] == '(')                   // 当遇到括号
                {
                    k++;
                    while (str[k] != ')')           // 记录括号中的WA次数
                    {
                        wa = wa * 10 + str[k] - '0';
                        k++;
                    }
                    break;
                }
                else                                // 还没有遇到括号
                {
                    time = time * 10 + str[k] - '0';// 记录本题的耗时
                }
            }
            S[d].solved++;
            S[d].time += (time + wa*m);
        }
        d++;
    }
    sort(S, S + d, cmp);
    for (int i = 0; i < d; i++) {
        printf("%-10s %2d %4d
", S[i].name.c_str(), S[i].solved, S[i].time);
    }
    return 0;
}