2018icpc青岛Books 思维

题意：

DreamGrid went to the bookshop yesterday. There are books in the bookshop in total. Because DreamGrid is very rich, he bought the books according to the strategy below:

• Check the books from the 1st one to the -th one in order.
• For each book being checked now, if DreamGrid has enough money (not less than the book price), he’ll buy the book and his money will be reduced by the price of the book.
• In case that his money is less than the price of the book being checked now, he will skip that book.

BaoBao is curious about how rich DreamGrid is. You are asked to tell him the maximum possible amount of money DreamGrid took before buying the books, which is a non-negative integer. All he knows are the prices of the books and the number of books DreamGrid bought in total, indicated by .

Input

There are multiple test cases. The first line of the input contains an integer , indicating the number of test cases. For each test case:

The first line contains two integers and (, ), indicating the number of books in the bookshop and the number of books DreamGrid bought in total.

The second line contains non-negative integers (), where indicates the price of the -th book checked by DreamGrid.

It’s guaranteed that the sum of in all test cases will not exceed .

Output

For each test case output one line.

If it’s impossible to buy books for any initial number of money, output “Impossible” (without quotes).

If DreamGrid may take an infinite amount of money, output “Richman” (without quotes).

In other cases, output a non-negative integer, indicating the maximum number of money he may take.

Sample Input

4
4 2
1 2 4 8
4 0
100 99 98 97
2 2
10000 10000
5 3
0 0 0 0 1

Sample Output

6
96
Richman
Impossible

​ 大概意思就是给T组样例，每组一个n，m代表n本书，买了其中m本。然后再给出n本书的价格。购买规则是从前往后遍历书，只要书的价格小于自己剩余的钱数，就购买，否则就跳过。问恰好能买m本拥有的钱最多是多少？若过能全买输出Richman，如果不能恰好买m本输出Impossible；

思路：

​ 若n == m就Richman，否则第一遍遍历价格为0的书的数量。如果大于m就Impossible。否则就遍历剩下的不为0的图书，小于<= m - 价格为0的数量时，累加钱数，当> m - 价格为0的数量时，比较出其中的最小值。最后答案为累加的钱数+ 最小值 -1

代码：

#include <stdio.h>
#include <algorithm>
using namespace std;
int a[100005];

int main () {
    int T, n, m;
    scanf("%d", &T);
    while (T--) {
        long long sum = 0;
        int num = 0;
        int minn = 0x3f3f3f3f;
        int flag = 0;
        scanf("%d%d", &n, &m);
        if (n == m) flag = 1;
        for (int i = 1; i <= n; i++) {
            scanf("%d", &a[i]);
            if (a[i] == 0) num ++;
        }
        if (num > m) flag = 2;
        else m -= num;
        if (!flag) {
            int tot = 0;
            for (int i = 1; i <= n; i++) {
                if (flag) break;
                if (a[i] == 0) continue;
                tot++;
                if (tot <= m) {
                    sum += a[i];
                } else {
                    minn = min(minn, a[i]);
                }
            }
        }
        if (minn == 0) {
            flag = 2;
        } else {
            sum += minn - 1;
        }
        if (flag == 1) printf("Richman\n");
        else if(flag == 2) printf("Impossible\n");
        else printf("%lld\n", sum);
    }
    return 0;
}

转载请注明出处！！！

如果有写的不对或者不全面的地方 可通过主页的联系方式进行指正，谢谢