The 2018 ACM-ICPC Asia Qingdao Regional Contest J. Books(思维)

#include <bits/stdc++.h>
#define maxn 100005
#define inf 0x3f3f3f3f
#define ll long long
using namespace std;
int T,n,m;
ll pre[maxn];

int main()
{
	scanf("%d",&T);
	while(T--){
		scanf("%d%d",&n,&m);
		ll ans1 = 0;
		int cnt = 0;
		for(int i=0;i<n;i++){
			scanf("%lld",&pre[cnt]);
			if(pre[cnt] == 0) ans1 ++;
			else cnt ++;
		}
		if(n == m){
			puts("Richman");
			continue;
		}
		if(ans1 > m){
			puts("Impossible");
			continue;
		}
		m -= ans1;
		ll ans = 0;
		for(int i=0;i<m;i++){
			ans += pre[i];
		}
		ll Min = inf;
		for(int i=m;i<cnt;i++){
			Min = min(Min, pre[i]);
		}
		printf("%lld\n",ans + Min - 1);
	}
	return 0;
}