Submission #1213052

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long int64;

const int64 INF = 1LL << 58;

int main()
{
  int64 N, K, A[15];

  cin >> N >> K;
  for(int i = 0; i < N; i++) {
    cin >> A[i];
  }

  int64 ret = INF;
  for(int i = 0; i < 1 << N; i++) {
    if(__builtin_popcount(i) < K) continue;
    int64 cost = 0, last = 0;
    for(int j = 0; j < N; j++) {
      if((i >> j) & 1) {
        last = max(last + 1, A[j]);
        cost += last - A[j];
      } else if(A[j] > last) {
        cost = INF;
      }
    }
    ret = min(ret, cost);
  }

  cout << ret << endl;
}

Submission Info

Judge Result