HDU 1304（A Contesting Decision）

基础题。

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
const int MAXN = 1000;

struct team //队伍
{
	string name; //队伍名
	int solve = 0; //解决问题数量
	int penalty = 0; //惩罚时间
}t[MAXN];

//排序要求
bool cmp(team t1, team t2)
{
	if (t1.solve != t2.solve)
		return t1.solve > t2.solve;
	else
		return t1.penalty < t2.penalty;
}

int main()
{
	int n;
	while (cin >> n)
	{
		int count; //当前题目提交次数
		int time; //当前题目用时
		for (int i = 0; i < n; i++)
		{
			cin >> t[i].name;
			for (int j = 0; j < 4; j++) //依次输入4道题目的提交次数和用时
			{
				cin >> count >> time;
				if (time == 0) //当前题目未解决
					continue;
				t[i].solve++;
				t[i].penalty += (time + (count - 1) * 20);
			}
		}
		sort(t, t + n, cmp); //排序
		cout << t[0].name << " " << t[0].solve << " " << t[0].penalty << endl;
	}
	return 0;
}

继续加油。

标签：1304,HDU,int,t2,t1,penalty,Contesting,solve,time
来源： https://blog.csdn.net/Intelligence1028/article/details/104901381