제출 #595435

#제출 시각아이디문제언어결과실행 시간메모리
595435BelphegorStove (JOI18_stove)C++14
20 / 100
54 ms340 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...