Submission #1213103

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb emplace_back
#define INF (1LL<<59)

#define int ll

signed main(){
    int n,k;
    cin>>n>>k;
    vector<int> a(n);
    rep(i,n)cin>>a[i];
    
    if(k<=1){
        cout<<0<<endl;
        return 0;
    }
    
    int ans = INF;
    for(int i=0;i<1<<n;i++){
        vector<int> v(n);
        int num = i;
        int c=0;
        rep(j,n){
            v[j] = num%2;
            num/=2;
            if(v[j]==1)c++;
        }
        if(c<k)continue;
        if(v[0]==0)continue;
        
        int tmp = 0;
        int now = -1;
        rep(j,v.size()){
            if(v[j]==0)continue;
            if(a[j]<=now){
                tmp+=now-a[j]+1;
                now = now+1;
            }else{
                now = a[j];
            }
        }
        ans = min(ans,tmp);
    }
    cout<<ans<<endl;
}

Submission Info

Judge Result