1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e5 + 5;
#define rep(i, a, n) for (int i = a; i < n; ++i)
#define per(i, a, n) for (int i = n - 1; i >= a; --i)
#define fi first
#define se second
#define pb push_back
#define np next_permutation
#define mp make_pair
#define endl '\n'
int n, k;
struct node {
int w, id;
};
node a[maxn];
bool cmp(node a, node b)
{
if (a.w != b.w)
return a.w > b.w;
else
return a.id < b.id;
}
int add[20];
int main()
{
ios::sync_with_stdio(false);
while (cin >> n >> k) {
rep(i, 1, 10 + 1) cin >> add[i];
rep(i, 1, n + 1)
{
cin >> a[i].w;
a[i].id = i;
}
sort(a + 1, a + n + 1, cmp);
rep(i, 1, n + 1)
{
a[i].w += add[(i - 1) % 10 + 1];
}
sort(a + 1, a + n + 1, cmp);
cout << a[1].id;
rep(i, 2, k + 1)
{
cout << " " << a[i].id;
}
cout << endl;
}
}
|