Submission #2529123

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for (int i=0;i<(n);i++)
#define MOD 1000000007
#define INF 1000000000009
typedef long long ll;
typedef pair<int,int> P;
#define YES(s) s?cout << "YES" << endl:cout << "NO" << endl
#define Yes(s) s?cout << "Yes" << endl:cout << "No" << endl
#define Taka(s) s?cout << "Takahashi" << endl:cout << "Aoki" << endl
#define int ll

signed main(){
    int N , K , a[17],b[17];
    cin >> N >> K;
    int Ans = INF;
    REP(i,N){cin >> a[i];b[i]=a[i];}
    REP(i,1<<(N-1)){
        REP(i,15){
            a[i]=b[i];
        }
        int sum=0;
        int c=1;
        int mx=a[0];
        REP(j,N-1){
            if((1 & i >> j) == 1){
                if(mx>=a[j+1]){
                    sum+=mx-a[j+1]+1;
                    a[j+1]=mx+1;
                }
            }
            mx = max(mx,a[j+1]); 
        }
        mx=a[0];
        REP(i,N){
            if(i==0)continue;
            if(mx<a[i]){
                c++;
                mx=a[i];
            }
        }
        if(c>=K){
            Ans = min(sum,Ans);
        }
    }
    cout << Ans << endl;
	return 0;
}

Submission Info

Judge Result