URAL - 1821 Biathlon(水题)

Biathlon

Time Limit: 500MS

Memory Limit: 65536KB

64bit IO Format: %I64d & %I64u

Submit Status

Description

In a biathlon race with staggered starts the contestants start by turns with an interval of 30 seconds, that is why the contestant who finished first is not necessarily the first in the final results table. For example, if a biathlete who started second came to the finish 25 seconds later than the biathlete who started first, then she ran the race 5 seconds faster and would be placed higher in the results table.

Only three years remain until the 2014 Winter Olympic Games, which will be held in the city of Yekaterinozavodsk. A new biathlon course is almost complete, and the shooting range and stands have already been built.

It is planned to mount an electronic scoreboard near the stands. During a race the scoreboard will show the name of the contestant with the current best result. You are asked to write a program to determine such a contestant. You have taken the final protocol of the recent Biathlon World Championships as initial data for testing your program. The protocol contains the names of biathletes and their running times. The names are given in the order of starts. To verify the correctness of the program, you should find all contestants whose names must appear on the scoreboard.

Input

The first line contains the number of biathletes participating in the race   n  (1 ≤   n  ≤ 100). In the   i-th of the following   n  lines you are given the name of the contestant who was   i-th to start and, after a space, the contestant's running time in the format “mm:ss.d” given with an accuracy of tenths of a second. It is guaranteed that no two contestants finished simultaneously and no two contestants showed the same result. The name of a biathlete is a nonempty string consisting of English letters of length at most 20. The first letter of a name is capital and the other letters are small. The names of all the contestants are different.

Output

In the first line output the number of biathletes who were leaders of the race immediately after their finish. Then output the names of these contestants in the lexicographic order, one per line.

Sample Input

input	output
6 Zaitseva 21:38.2 Hauswald 21:21.0 Boulygina 22:04.4 Henkel 22:06.1 Wilhelm 21:11.1 Jonsson 22:05.8	3 Hauswald Wilhelm Zaitseva

读题还是有难度的，首先竞赛者是隔 30s一个出发的，按出发顺序给出名字和完成比赛的总时间，规定到达终点时更新用时最少的竞赛者，用时最少的显示在屏幕上，在屏幕上是按字典序排列的，几个排序处理就好了。

#include<iostream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<queue>
using namespace std;
struct node
{
	string name;
	double totalTime;
	double minute;
	double second;
	double endTime;
	void gettotalTime()
	{
		totalTime = minute * 60 + second;
	}
	bool operator<(const node b)const
	{
		return name > b.name;
	}
}con[105];
bool cmp(node a, node b)
{
	return a.endTime < b.endTime;
}
int main()
{
	int n;
	while (cin >> n)
	{
		int temp = 0;
		for (int i = 0; i < n; i++)
		{
			cin >> con[i].name;
			scanf("%lf:%lf", &con[i].minute, &con[i].second);
			con[i].gettotalTime();
			con[i].endTime = con[i].totalTime + temp;
			temp += 30;
		}
		sort(con, con + n, cmp);
		priority_queue<node>que;
		double minn = 10e6;
		
		for (int i = 0; i < n; i++)
		{
			if (con[i].totalTime < minn)
			{
				que.push(con[i]);
				minn = con[i].totalTime;
			}
		}
		cout << que.size() << endl;
		while (!que.empty())
		{
			cout << que.top().name << endl;
			que.pop();
		}
	}
}