1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e5 + 5;
#define rep(i, a, n) for (int i = a; i < n; ++i)
#define per(i, a, n) for (int i = n - 1; i >= a; --i)
#define fi first
#define se second
#define pb push_back
#define np next_permutation
#define mp make_pair
#define endl '\n'
struct node {
int id, score;
};
node a[maxn], ans[maxn];
bool cmp(node a, node b)
{
if (a.score != b.score)
return a.score > b.score;
else
return a.id < b.id;
}
int n, m;
int main()
{
ios::sync_with_stdio(false);
while (cin >> n >> m) {
m = (int)(m * 1.5);
if (m > n)
m = n;
rep(i, 1, n + 1) cin >> a[i].id >> a[i].score;
sort(a + 1, a + n + 1, cmp);
int cnt = 1;
while (cnt <= n && a[cnt].score >= a[m].score) {
ans[cnt].id = a[cnt].id;
ans[cnt].score = a[cnt].score;
cnt++;
}
cnt--;
cout << a[m].score << " " << cnt << endl;
rep(i, 1, cnt + 1)
{
cout << ans[i].id << " " << ans[i].score << endl;
}
}
}
|