#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
#include<cstdio>
struct node{
int score;
int id;
};
node student[5500];
int main()
{
int n,m,ruwei,i,j,cnt=0;
cin>>n>>m;
ruwei=floor(m*1.5);
for(i=1;i<=n;i++)
cin>>student[i].id>>student[i].score;
for(i=n-1;i>=1;i--)
for(j=1;j<=i;j++)//条件需要写清楚,这里很容易出错,冒泡法排序的起点和终点需要明确,便利很容易超出范围
{
if(student[j].score<student[j+1].score)
swap(student[j],student[j+1]);
else if((student[j].score==student[j+1].score)&&(student[j].id>student[j+1].id))
swap(student[j],student[j+1]);
}
for(i=1;i<=n;i++)
if(student[i].score>=student[ruwei].score)
{
cnt++;
}
cout<<student[ruwei].score<<" "<<cnt<<endl;
for(i=1;i<=cnt;i++)
cout<<student[i].id<<" "<<student[i].score<<endl;
return 0;
}
分数线划定
猜你喜欢
转载自blog.csdn.net/u010583225/article/details/82114594
今日推荐
周排行