全对

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

// 定义选手结构体
struct Candidate {
int id;
int score;
};

// 自定义比较函数，用于排序
bool compare(const Candidate& a, const Candidate& b) {
if (a.score != b.score) {
return a.score > b.score;
}
return a.id < b.id;
}

int main() {
int n, m;
cin >> n >> m;

vector<Candidate> candidates(n);
for (int i = 0; i < n; ++i) {
    cin >> candidates[i].id >> candidates[i].score;
}

// 对选手按成绩和报名号排序
sort(candidates.begin(), candidates.end(), compare);

// 计算面试分数线的排名
int rank = static_cast<int>(m * 1.5);
int cutoff = candidates[rank - 1].score;

// 统计进入面试的人数
int count = 0;
for (int i = 0; i < n; ++i) {
    if (candidates[i].score >= cutoff) {
        ++count;
    }
}

// 输出面试分数线和进入面试的人数
cout << cutoff << " " << count << endl;

// 输出进入面试的选手信息
for (int i = 0; i < count; ++i) {
    cout << candidates[i].id << " " << candidates[i].score << endl;
}

return 0;

}