Codeforces Round #346 (Div. 2) B. Qualifying Contest
来源:互联网 发布:linux搭建hadoop 编辑:程序博客网 时间:2024/05/22 16:52
Very soon Berland will hold a School Team Programming Olympiad. From each of the m Berland regions a team of two people is invited to participate in the olympiad. The qualifying contest to form teams was held and it was attended by n Berland students. There were at least two schoolboys participating from each of the m regions of Berland. The result of each of the participants of the qualifying competition is an integer score from 0 to 800 inclusive.
The team of each region is formed from two such members of the qualifying competition of the region, that none of them can be replaced by a schoolboy of the same region, not included in the team and who received a greater number of points. There may be a situation where a team of some region can not be formed uniquely, that is, there is more than one school team that meets the properties described above. In this case, the region needs to undertake an additional contest. The two teams in the region are considered to be different if there is at least one schoolboy who is included in one team and is not included in the other team. It is guaranteed that for each region at least two its representatives participated in the qualifying contest.
Your task is, given the results of the qualifying competition, to identify the team from each region, or to announce that in this region its formation requires additional contests.
The first line of the input contains two integers n and m (2 ≤ n ≤ 100 000, 1 ≤ m ≤ 10 000, n ≥ 2m) — the number of participants of the qualifying contest and the number of regions in Berland.
Next n lines contain the description of the participants of the qualifying contest in the following format: Surname (a string of length from 1 to10 characters and consisting of large and small English letters), region number (integer from 1 to m) and the number of points scored by the participant (integer from 0 to 800, inclusive).
It is guaranteed that all surnames of all the participants are distinct and at least two people participated from each of the m regions. The surnames that only differ in letter cases, should be considered distinct.
Print m lines. On the i-th line print the team of the i-th region — the surnames of the two team members in an arbitrary order, or a single character "?" (without the quotes) if you need to spend further qualifying contests in the region.
5 2Ivanov 1 763Andreev 2 800Petrov 1 595Sidorov 1 790Semenov 2 503
Sidorov IvanovAndreev Semenov
5 2Ivanov 1 800Andreev 2 763Petrov 1 800Sidorov 1 800Semenov 2 503
?Andreev Semenov
In the first sample region teams are uniquely determined.
In the second sample the team from region 2 is uniquely determined and the team from region 1 can have three teams: "Petrov"-"Sidorov", "Ivanov"-"Sidorov", "Ivanov" -"Petrov", so it is impossible to determine a team uniquely.
题意:给你一些队伍,让你输出分数最高的前两支队伍,如果有第二支和第三支分数相同就输出?
此题排个序就能出来了
#include<iostream>#include<map>#include<cstdio>#include<algorithm>using namespace std;struct p{int x,y;char str[20];}a[222222];int cmp(p a,p b){if(a.x==b.x){return a.y>b.y;}elsereturn a.x<b.x;}int main(){int n,m;while(cin>>n>>m){for(int i=0;i<n;i++)cin>>a[i].str>>a[i].x>>a[i].y;sort(a,a+n,cmp);for(int i=1;i<=m;i++){for(int j=0;j<n;j++){if(a[j].x==i){if(a[j+2].x==i&&a[j+2].y==a[j+1].y){printf("?\n");break;}else{printf("%s %s\n",a[j].str,a[j+1].str);break;}}}}}return 0;}
- Codeforces Round #346 (Div. 2)-B. Qualifying Contest(排序)
- Codeforces Round #346 (Div. 2)--B. Qualifying Contest
- Codeforces Round #346 (Div. 2) B. Qualifying Contest
- Codeforces Round #346 (Div. 2) - B Qualifying Contest
- Codeforces Round #346 (Div. 2) B. Qualifying Contest
- Codeforces Round #346 (Div. 2) B - Qualifying Contest 优先队列
- CodeForces 659B Qualifying Contest
- CodeForces-659B-Qualifying Contest
- Codeforces Round#289(DIV.2) + qualifying round for WCC
- Codeforces Round #216 (Div. 2) B. Valera and Contest
- Codeforces Round #216 (Div. 2) B. Valera and Contest
- Codeforces 659B Qualifying Contest【模拟,读题】
- Codeforces 659B Qualifying Contest 【模拟】
- Codeforces Round #346 (Div. 2) B
- Codeforces Round #222 (Div. 1) B - Preparing for the Contest
- B - Qualifying Contest
- contest: Codeforces Round #297 (Div. 2), problem: (B) Pasha and String
- Codeforces Round #442 (Div. 2) A. Alex and broken contest,B
- 【matlab】:matlab中不断的出现计算过程怎么办
- Codeforces Round #346 (Div. 2) C. Tanya and Toys
- 堆和栈
- HDU 1875 畅通工程再续
- hdu1596 find the safest road--多源最短路径
- Codeforces Round #346 (Div. 2) B. Qualifying Contest
- BaseAdapter使用与优化
- VS2010+OpenCV的SDI应用——(一)打开图像
- C++泛型编程总结(二)
- 网络:NSURLConnection队列
- POJ-1236-Network of Schools【强连通分量】【缩点】
- 杭电1008
- rails中使用ajax
- 面向对象