洛谷 P1068

分数线划定

#include<iostream>
#include<algorithm>
#include<math.h>
using namespace std;
struct student
{
	string num;
	int grade;
};
bool cmp(student a,student b)
{
	if(a.grade!=b.grade)
		return a.grade>b.grade;
	else
		return a.num<b.num;
}
int main()
{
	int n,m;
	cin>>n>>m;
	m=floor(m*1.5);
	student *stu=new student[n];
	for(int i=0;i<n;i++)
		cin>>stu[i].num>>stu[i].grade;
	sort(stu,stu+n,cmp);
	int pass=stu[m-1].grade;
	for(int i=m;i<n;i++)
		if(stu[i].grade>=pass)
			m++;
	cout<<stu[m-1].grade<<" "<<m<<endl;
	for(int i=0;i<m;i++)
		cout<<stu[i].num<<" "<<stu[i].grade<<endl;
}