Submission #1213982

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>

#define REP(i,a,b) for(int i=int(a);i<int(b);i++)

using namespace std;

typedef long long int lli;

int main () {
    int N, K;
    cin >> N >> K;
    vector<lli> a(N);
    REP (i, 0, N) cin >> a[i];
    lli m = 1LL << 60;
    vector<int> patterns(N, 0);
    REP (i, 0, K) patterns[i] = 1;
    sort(patterns.begin(), patterns.end());
    do {
        lli cost = 0;
        lli tall = 0;
        REP (i, 0, N) {
            if (patterns[i]) {
                if (tall > a[i]) cost += (tall - a[i]);
            }
            tall = max(a[i], tall) + patterns[i];
        }
        m = min (m, cost);
    } while (next_permutation(patterns.begin(), patterns.end()));
    cout << m << endl;
    return 0;
}

Submission Info

Judge Result