蒟蒻求助，玄关

#include<bits/stdc++.h>
using namespace std;
int e[15];
int w[20005];
int id[20005]; 
bool cmp(int a, int b) {
    if(w[a] != w[b]) 
        return w[a] > w[b];
    return a < b; 
}
bool cmp_final(int a, int b) {
    int wa = w[a] + e[(id[a]-1)%10 + 1];
    int wb = w[b] + e[(id[b]-1)%10 + 1];
    if(wa != wb)
        return wa > wb;
    return a < b; 
}
int main() {
    int n, k;
    cin >> n >> k;
    for(int i=1; i<=10; i++) 
        cin >> e[i];
    for(int i=1; i<=n; i++) {
        cin >> w[i];
        id[i] = i; 
    }
    sort(id+1, id+1+n, cmp);
    for(int i=1; i<=n; i++) 
        id[i] = i;
    sort(id+1, id+1+n, cmp_final);
    for(int i=1; i<=k; i++) 
        cout << id[i] << " ";
    return 0;
}