小白鼠排队 【简单 / 排序】

https://www.nowcoder.com/practice/27fbaa6c7b2e419bbf4de8ba60cf372b?tpId=40&tqId=21368&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 w;
	string color;
}stu[105];
bool cmp(student a,student b)
{
	return a.w>b.w;
}
int main(void)
{
	int n; cin>>n;
	for(int i=0;i<n;i++)
	{
		cin>>stu[i].w>>stu[i].color;
	} 
	sort(stu,stu+n,cmp);
	for(int i=0;i<n;i++)
	{
		cout<<stu[i].color<<endl;
	}
	return 0;
} 

标签：排序,2Fta%,int,排队,stu,小白鼠,student,include,color
来源： https://blog.csdn.net/bettle_king/article/details/115408050