按从大到小排列

#include <iostream>
#include <vector>
using namespace std;

void Myprintnums(vector<int>& nums){
	for (auto i:nums){
		cout << i << " ";
	}
	cout << endl;
}

void Myselectsort(vector<int>& nums){
	int len = nums.size();
	int maxplace = 0;
	for (int i = 0; i < len-1; i++){
		maxplace = i;
		for(int j = i+1; j < len; j++){
			if (nums[maxplace] < nums[j]){
				maxplace = j;
			}
		}
		swap(nums[maxplace], nums[i]);
	}
}

int main(){
	vector<int> nums = {2,3,41,23,21,21,1,2,34,2};
	Myselectsort(nums);
	Myprintnums(nums);
	return 0;
}

学习资料：阿秀的求职笔记