Codeforces Round #346 (Div. 2) B. Qualifying Contest
2016-04-07 21:47
155 查看
B. Qualifying Contest
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
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.
Output
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.
Examples
input
output
input
output
Note
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.
这是一道排序题;
按照编号的不同,在相同的编号中,按分数的高低进行排序,只是注意输出“?”的情况;
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
Input
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.
Output
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.
Examples
input
5 2 Ivanov 1 763 Andreev 2 800 Petrov 1 595 Sidorov 1 790 Semenov 2 503
output
Sidorov Ivanov Andreev Semenov
input
5 2 Ivanov 1 800 Andreev 2 763 Petrov 1 800 Sidorov 1 800 Semenov 2 503
output
? Andreev Semenov
Note
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; }
相关文章推荐
- mac 如何显示隐藏文件和.点开头文件?
- 生成1-N的排列
- 返回一个二维整数数组中最大联通子数组的和
- 线程 1
- PAT 1006. 换个格式输出整数 (15)
- CCF-201512-3 画图
- 封装.a文件以及应用.a文件
- mysql导入数据乱码
- eclipse 代码恢复到历史版本
- 设计模式六大原则——合成/聚合复用原则(CARP)
- 控制台当前行显示进度条,不换行
- vagrant系列二:vagrant的配置文件vagrantfile详解
- 树形dp-hdu1520
- 7个你可能不认识的CSS单位:rem vh vw vmin vmax ex ch
- linux下的软硬链接
- ZCCZCC Loves Codefires
- cocos2d-js常用命令
- CentOS 7 安装gogs git代码服务器
- 吴超老师课程--Hbase介绍和伪分布式安装
- Redis集群明细文档(转)