每日一WA

#include<bits/stdc++.h>
using namespace std;
int n,m;
int cnt;
struct node{
	int num,pts;
}a[5005];
int plan=floor(m*1.5);
int line;
bool cmp(node a,node b){
	if(a.pts!=b.pts)return a.pts>b.pts;
	if(a.num<b.num)return a.pts>b.pts;
	return a.pts<b.pts;
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a[i].num>>a[i].pts;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=n;i++){
		if(i==plan)line=a[i].pts;
	}
	for(int i=1;i<=n;i++){
		if(a[i].pts>=line)cnt++;
	}
	cout<<line<<" "<<cnt<<endl;
	for(int i=1;i<=cnt;i++){
		cout<<a[i].num<<" "<<a[i].pts<<endl;
	}
	return 0;
}