哈利波特Grit

#include<iostream>
#include<algorithm>
using namespace std;
struct pai {
	int xu ;
	int w ;
}arr[100000];
bool com(pai q, pai p) {
	if (q.w == p.w)return q.xu < p.xu;
	return q.w > p.w;
}
int main() {
	int n, m;
	cin >> n >> m;
	int e[11] = { 0 };
	for (int i = 1; i <= 10; i++) {
		cin >> e[i];
	}
	for (int i = 1; i <= n; i++) {
		cin >> arr[i].w;
		arr[i].xu = i;
	}
	sort(arr + 1, arr + n + 1, com);
	for (int i = 1; i <= n; i++) {
		arr[i].w += e[(i - 1) % 10 + 1];
	}
	sort(arr + 1, arr + n + 1, com);
	for (int i = 1; i <= m; i++) {
		cout << arr[i].xu << " ";
	}
	return 0;
}

模拟