一看你们就没有好好读题

根据题意，我们应用选择排序解这道题

#include <iostream>
#include <cstdio>
#include <ctime>
using namespace std;
struct node{
	string name;
	int xiaolv;
}a[105]; 
bool cmp(node a, node b){
	return a.xiaolv > b.xiaolv;
}

void selectionsort(node *a, int len){
	for(int i = 1; i <= len; i++){
		node mi = a[i];
		int idx = i;
		for(int j = i + 1; j <= len; j++){
			if(cmp(a[j], mi)) mi = a[j], idx = j;//寻找最小值 
		}swap(a[i], a[idx]);//交换 
	}
}


int main(){
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++) cin >> a[i].name >> a[i].xiaolv;
	selectionsort(a, n);
	for(int i = 1; i <= n; i++) cout << a[i].name  << ' ' << a[i].xiaolv << endl;

	return 0;
}