『题解』A5.分数线划定

#include <bits/stdc++.h>
using namespace std;
#define int long long
struct node{
	string name;
	int num;
}a[100005];
bool cmp(node x,node y){
	if(x.num==y.num){
		return x.name<y.name;
	}
	return x.num>y.num;
}
signed main(){
	int n,m_m;
	cin>>n>>m_m;
	int m=floor(m_m*1.5);
	for(int i=1;i<=n;i++){
		cin>>a[i].name>>a[i].num;
	}
	sort(a+1,a+n+1,cmp);
	cout<<a[m].num<<" ";
	int sum=0;
	for(int i=1;i<=n;i++){
		if(a[i].num>=a[m].num){
			sum++;
		}
	}
	cout<<sum<<endl; 
	for(int i=1;i<=n;i++){
		if(a[i].num>=a[m].num){
			cout<<a[i].name<<" "<<a[i].num<<endl;
		}
	}
	return 0;
}