Submission #3569437

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
int n, k;
long long a[16];
long long ans = 1e9 * 2;
int main() {
	cin >> n >> k;
	rep(i, n)cin >> a[i];
	rep(i, 1 << n) {
		int c = 0;
		rep(j, n)if (i&(1 << j))c++;
		if (c != k)continue;
		long long cnt = 0;
		long long mem = 0;
		rep(j, n) {
			if (i&(1 << j)) {
				cnt += max((long long)0, mem - a[j] + 1);
				mem++;
			}
			mem = max(mem, a[j]);
		}
		ans = min(ans, cnt);
	}
	cout << ans << endl;
	getchar();getchar();
}

Submission Info

Judge Result