What Is Your Grade?

What Is Your Grade?

#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
struct node
{
	int list;		//原来的排序 
	int n;		//解决的题数 
	int time;		//花的时间（转化为秒） 
	int grade;		//最终成绩
}pre[111];
bool cmp1(node a,node b)
{
	if (a.n==b.n)
		return a.time<b.time;
	return a.n>b.n;
}
bool cmp2(node a,node b)
{
	return a.list<b.list;
}
int main()
{
	int u;
	int num[6];
	int th,tm,ts;		//时间 
	while (~scanf ("%d",&u) && (u>0))
	{
		memset (num,0,sizeof (num));
		for (int i=0;i<u;i++)
		{
			scanf ("%d %d:%d:%d",&pre[i].n,&th,&tm,&ts);
			pre[i].grade=50+pre[i].n*10;
			pre[i].list=i;
			pre[i].time=3600*th+60*tm+ts;
			num[pre[i].n]++;
		}
		sort (pre,pre+u,cmp1);
		
		num[1]/=2;
		num[2]/=2;
		num[3]/=2;
		num[4]/=2;
		for (int i=0,j=4;i<u;i++)
		{
			if (pre[i].n==0 || pre[i].n==5)
				continue;
			j=pre[i].n;
			if (num[j]==0)
				continue;
			else
			{
				pre[i].grade+=5;
				num[j]--;
			}
		}
		sort (pre,pre+u,cmp2);
		for (int i=0;i<u;i++)
		{
			printf ("%d\n",pre[i].grade);
		}
		printf ("\n");
	}
	return 0;
}

思路：此题不做过多的讲解，主要的是95分数段那一块。仔细看应该不难理解。ヾ(◍°∇°◍)ﾉﾞ