This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
using namespace std;
typedef long long ll;
int T[20];
int main(){
int n,k; cin>>n>>k;
for(int i=0; i<n; i++) cin>>T[i];
int ans = 2e9;
for(int i=0; i<(1<<n); i++){
int w = 1;
int on = (i&1);
int c = 1;
for(int j=1; j<n; j++){
if(!on){
++c; ++w;
}
else{
w+=T[j]-T[j-1];
}
on = (i&(1<<j));
}
if(c<=k) ans = min(ans,w);
}
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |