成绩排序 【简单 / sort 】

在这里插入图片描述
https://www.nowcoder.com/practice/3f27a0a5a59643a8abf0140b9a8cf1f7?tpId=40&tqId=21340&rp=1&ru=%2Fta%2Fkaoyan&qru=%2Fta%2Fkaoyan%2Fquestion-ranking&tab=answerKey

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
struct student
{
    
    
	int id;
	int score;
}stu[105];
bool cmp(student a,student b)
{
    
    
	if(a.score==b.score)
		return a.id<b.id;
	return a.score<b.score;
}
int main(void)
{
    
    
	int n; cin>>n;
	for(int i=0;i<n;i++)
	{
    
    
		cin>>stu[i].id>>stu[i].score;
	}
	sort(stu,stu+n,cmp);
	for(int i=0;i<n;i++)
	{
    
    
		cout<<stu[i].id<<" "<<stu[i].score<<endl;
	}
	return 0;
} 

猜你喜欢

转载自blog.csdn.net/bettle_king/article/details/115408287