AcWing 438. 分数线划定
原题链接
简单
作者:
openallzzz
,
2022-07-04 13:37:26
,
所有人可见
,
阅读 181
#include <iostream>
#include <string>
#include <algorithm>
#define x first
#define y second
using namespace std;
const int N = 5010;
typedef pair<int, int> PII;
int n, m;
PII v[N];
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i ++)
cin >> v[i].x >> v[i].y;
sort(v + 1, v + n + 1, [](const PII& a, const PII& b){
if(a.y != b.y) return a.y > b.y;
return a.x < b.x;
});
int t = v[(int)(m * 1.5)].y;
int res = 0;
for(int i = 1; i <= n; i ++)
if(v[i].y >= t) res ++;
cout << t << ' ' << res << endl;
for(int i = 0; i <= n; i ++)
{
if(v[i].y >= t)
{
cout << v[i].x << ' ' << v[i].y << endl;
}
}
return 0;
}