Submission #1244538

---

Source Code Expand

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mt make_tuple
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef tuple<int,int,int> tp;
typedef vector<tp> vt;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-7;
const int inf=1e8;
const ll INF=1e16;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
int main(){
	int n,k;
	cin>>n>>k;
	vi t(n);
	rep(i,k)t[n-1-i]=1;
	vi in(n);
	rep(i,n)cin>>in[i];
	ll out=INF;
	do{
		ll sum=0;
		int ma=0;
		rep(i,n){
			if(t[i]){
				if(ma<in[i]){
					ma=in[i];
				}else{
					sum+=ma+1-in[i];
					ma++;
				}
			}else{
				ma=max(ma,in[i]);
			}
		}
		out=min(out,sum);
	}while(next_permutation(all(t)));
	cout<<out<<endl;
}

Submission Info

Judge Result