Codeforces Round #346 (Div. 2) B. Qualifying Contest 水题

最新推荐文章于 2022-08-21 01:05:54 发布

weixin_34383618

最新推荐文章于 2022-08-21 01:05:54 发布

阅读量180

点赞数

文章标签：数据结构与算法

本文介绍了一个关于Berland学校团队编程奥林匹克竞赛的选拔过程。根据参赛者的分数，每个地区需要选择得分最高的两名学生组成队伍参加比赛。若最高分的学生超过两人且分数相同，则该地区需进一步选拔。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

B. Qualifying Contest

题目连接：

http://www.codeforces.com/contest/659/problem/B

Description

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 to 10 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.

Sample Input

5 2
Ivanov 1 763
Andreev 2 800
Petrov 1 595
Sidorov 1 790
Semenov 2 503

Sample Output

Sidorov Ivanov
Andreev Semenov

Hint

题意

给你n个人，然后有m个地区，每个地区将会选出分数最高的两个人

如果分数最高的不止两个人的话，输出？

题解：

每个地区都排序一波就好了

然后比较一下第二和第三的分数，如果一样的话，就输出？

代码

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+7;
vector<pair<int,string> >S[maxn];
bool cmp(pair<int,string> A,pair<int,string> B)
{
    return A.first>B.first;
}
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        string s;int x,y;
        cin>>s>>x>>y;
        S[x].push_back(make_pair(y,s));
    }
    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)cout<<S[i][0].second<<" "<<S[i][1].second<<endl;
        else
        {
            if(S[i][2].first==S[i][1].first)cout<<"?"<<endl;
            else cout<<S[i][0].second<<" "<<S[i][1].second<<endl;
        }
    }
}