P1068 分数线划定

#include<bits/stdc++.h>
using namespace std;
const int MAXN=10001;
struct Node{
	int id;
	int score;
}node[MAXN];
bool cmp(Node a,Node b){
	if(a.score!=b.score) return a.score>b.score;
	else return a.id<b.id;
}
int main()
{
	freopen("in.txt","r",stdin);
	int n,m;cin>>n>>m;
	for(int i=0;i<n;i++){
		cin>>node[i].id>>node[i].score;
	}
	sort(node,node+n,cmp);
	int num=node[(int)(m*1.5)-1].score;
	vector<Node> ppp;
	for(int i=0;i<n;i++){
		if(node[i].score>=num){
			ppp.push_back(node[i]);
		}
	}
	cout<<num<<' '<<ppp.size()<<endl;
	for(int i=0;i<ppp.size();i++){
		printf("%04d %d\n",ppp[i].id,ppp[i].score);
	}
	return 0;
}