Codeforces 507A - Amr and Music
Amr is a young coder who likes music a lot. He always wanted to learn how to play music but he was busy coding so he got an idea.
Amr has n instruments, it takes ai days to learn i-th instrument. Being busy, Amr dedicated k days to learn how to play the maximum possible number of instruments.
Amr asked for your help to distribute his free days between instruments so that he can achieve his goal.
Input:
The first line contains two numbers n, k (1 ≤ n ≤ 100, 0 ≤ k ≤ 10 000), the number of instruments and number of days respectively.
The second line contains n integers ai (1 ≤ ai ≤ 100), representing number of days required to learn the i-th instrument.
Output:
In the first line output one integer m representing the maximum number of instruments Amr can learn.
In the second line output m space-separated integers: the indices of instruments to be learnt. You may output indices in any order.
if there are multiple optimal solutions output any. It is not necessary to use all days for studying.
範例:
input:
1 | 4 10 |
output:
1 | 4 |
input:
1 | 5 6 |
output:
1 | 3 |
input:
1 | 1 3 |
output:
1 | 0 |
Note:
In the first test Amr can learn all 4 instruments.
In the second test other possible solutions are: {2, 3, 5} or {3, 4, 5}.
In the third test Amr doesn’t have enough time to learn the only presented instrument.
題意:
現在有k天的時間，他想要盡量學一些樂器，學第i種樂器的時間需要ai天，請問最多可以學幾種樂器，分別是哪幾種？
思路:
因為需要印出是哪幾種，所以不能直接排序，新建一個struct，存編號跟天數，然後再依據天數由小排到大。然後一直減k，直到沒得減了或k小於0了為止，最後輸出答案。