HDU 1084 类似acm计分

题意：解出0-5题得分区间不同。在解题相同的同学中，分数在该解题数前一半的同学加5分。排序即可

#include<iostream>
#include <string>
#include <algorithm>
using namespace std;
const int N = 110;
int a[N], flag[6];
typedef struct
{
	int num, index;
	//char str[10];
	string  str;
}Node;
Node node[N];

bool cmp(Node a, Node b)
{
	if(a.num != b.num)
		return a.num > b.num;
	else
		return a.str < b.str;
}
int main()
{
	int score[6] = {50, 60, 70, 80, 90, 100};
	int n;
	while(cin >> n && n >= 0)
	{
		memset(flag, 0, sizeof(flag));
		for(int i = 0;  i < n; i++)
		{
			/*scanf("%d%*c", &node[i].num);
			gets(node[i].str);*/
			cin >> node[i].num >> node[i].str;
			node[i].index = i;
			flag[node[i].num]++;
		}

		sort(node, node+n, cmp);

		for(int i = 0; i <=5; i++)
			flag[i] /= 2;
		for(int i = 0 ;i < n; i++)
		{
			int temp = score[node[i].num];
			if(flag[node[i].num] && node[i].num != 0 && node[i].num != 5)
			{
				flag[node[i].num]--;
				temp += 5;
			}
			a[node[i].index] = temp;
		}
		for(int i = 0; i < n; i++)
			cout << a[i] << endl;
		cout << endl;
	}
	return 0;
}