Codeforces Round #346 (Div. 2) B. Qualifying Contest
来源:互联网 发布:汉诺塔问题的算法设计 编辑:程序博客网 时间:2024/05/22 11:56
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<bits/stdc++.h>using namespace std;struct Temp{ string s; int score;};vector<Temp> s[100001];bool cmp(const Temp &a,const Temp &b){ return a.score>b.score;}int main(){ int n,m; Temp temp; string a; int b,c; scanf("%d %d",&n,&m); for(int i=0;i<n;++i) { cin>>a>>b>>c; temp.s=a; temp.score=c; s[b].push_back(temp); } for(int i=1;i<=m;++i) { sort(s[i].begin(),s[i].end(),cmp); } for(int i=1;i<=m;++i) { if(s[i].size()==2||s[i][1].score>s[i][2].score) cout<<s[i][0].s<<" "<<s[i][1].s<<endl; else puts("?"); } 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
- eclipse 代码恢复到历史版本
- 230. Kth Smallest Element in a BST
- php中include与require区别
- opencv轮廓检测之椭圆检测-----算法篇(8) Hough transformation检测椭圆
- BZOJ4027: [HEOI2015]兔子与樱花
- Codeforces Round #346 (Div. 2) B. Qualifying Contest
- 代码优化:重复代码封装成函数
- The type java.util.Map$Entry cannot be resolved. It is indirectly referenced
- 三峰记
- java中的static作用
- mysql事务处理
- HDOJ 1130 How Many Trees?(卡特兰数+大数乘除法)
- Java判断一个时间是否在另一个时间段内
- 哎呀,JSP小记_第一目