#include<bits/stdc++.h>
#define int long long
#define ff(i,a,b) for(int i=a;i<=b;i++)
#define fb(i,a,b) for(int i=a;i>=b;i--)
#define all(v) v.begin(),v.end()
#define pushb push_back
#define DEBUG cout<<"NO ERROR";return;
#define re return
using namespace std;
void faster(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N=25;const int INF=1e18;
int n,k;int t[N];int ans=INF;
void dq(int i,int time,int use){
if(use>k) return;
if(i>n){
ans=min(ans,time);return;
}
ff(j,i,n){
int haophi=t[j]-t[i]+1;
dq(j+1,time+haophi,use+1);
}
}
void solve(){
cin>>n>>k;
ff(i,1,n) {cin>>t[i];}
dq(1,0,0);
cout<<ans;
}
signed main() {
faster();
solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |