CodeForces - 659B Qualifying Contest（简单题）

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 nBerland 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 mregions. 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

Copy

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

output

Copy

Sidorov Ivanov
Andreev Semenov

input

Copy

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

output

Copy

?
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.

 

题目大意是：m个队的n个人比赛，现在每个队选两个人，选不出来输出‘？’，选出来了顺序输出两个人的名字；

排序以后只需要比较一下每个队的第二个和第三个分数是否相等，不等就行，如果只有两个必然可以；

我wa了很久，刚开始选第二个人的时候只比较了一下和第一个人分数是否一样，不一样就选定了这两个；

后来比较了第二个和第三个，但还是以为要选出来两个成绩不同的qwq；

总之是思想太过复杂了，狂wa，难过qwq；

小本本记下来，以后读题读清楚在做题，感觉很久不动脑子，脑壳都僵化了qwq

 

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;

struct people{
    char nam[30];
    int x;
    double y;
}peo[100010];

bool cmp(people a,people b){
    if(a.x!=b.x) return a.x<b.x;
    else return a.y>b.y;
}

int main()
{
    int n,m;
    while(cin >> n >> m){
        int i,j;
        for(i = 0;i < n;i++)
            cin >> peo[i].nam >> peo[i].x >> peo[i].y;
        sort(peo,peo+n,cmp);
        int k = 0,ans=1,ss=0,aa=0;
        double s = 0;
        for(i = 0;i < n;i++){
            if(peo[i].x==ans){
                if(peo[i+1].y!=peo[i+2].y || peo[i+1].x!=peo[i+2].x)
                    cout << peo[i].nam << ' ' << peo[i+1].nam << endl;
                else
                    cout <<'?' << endl;
            ans++;

        }
        }
    }
    return 0;
}