The 2018 ACM-ICPC Asia Qingdao Regional Contest Books

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=5824

解题思路：本来以为是个二分，因为每次选择都是有序的所以可以转换一下思路。价值为0的肯定要全拿，这样就可以判断出一些情况，然后是一直取，取够之后再在当前位置之后找一个最小值即可。

#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<set>
#include<cmath>
#include<stdlib.h>
#include<map>
#include<algorithm>
#include<cstring>
using namespace std;
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define sca(x) scanf("%d",&x)
#define pb(x) push_back(x)
#define per(i,j,k) for(int i=j;i>=k;i--)
#define inf 0x3f3f3f3f
#define LL long long
#define N 100005
#define MAXN 2000005
#define inf 0x3f3f3f3f

LL a[N];
int main()
{
    int t;
    sca(t);
    while(t--)
    {
        int n,m;
        scanf("%d%d",&n,&m);
        int c=0;
        LL mini=0x3f3f3f3f;
        rep(i,1,n)
        {
            scanf("%lld",&a[i]);
            if(a[i]==0)c++;
            if(a[i]!=0)
            mini=min(a[i],mini);
        }
        if(n==m)puts("Richman");
        else if(c>m) puts("Impossible");
        else
        {
            if(m==0||c==m) printf("%lld\n",mini-1);
            else
            {
                LL ans=0;
                int pos;
                rep(i,1,n)
                {
                    if(a[i]==0)continue;
                    if(c<m)ans+=a[i],c++;
                    if(c==m)
                    {
                        pos=i;
                        break;
                    }
                }
                mini=0x3f3f3f3f;
                rep(j,pos+1,n)
                {
                    if(a[j]!=0)mini=min(mini,a[j]);
                }
                ans+=mini-1;
                printf("%lld\n",ans);
            }
        }
    }
}