Submission #1286285

#TimeUsernameProblemLanguageResultExecution timeMemory
1286285juan_alejandroStove (JOI18_stove)C++20
50 / 100
1095 ms1100 KiB
#include <bits/stdc++.h> #define endl '\n' #define int long long #pragma GCC optimize("O2") using namespace std; int32_t main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout.precision(0); cout<<fixed; int n,k; cin>>n>>k; vector<int> x(n); for (int i = 0; i < n; i++) { cin>>x[i]; } vector<int> dp(k); int res=x[n-1]+1-x[0]; vector<bool> vis(n,false); //cout<<res<<endl; for (int j = 2; j <= k; j++) { int mx=-1,idx; for (int i = 1; i < n; i++) { if(vis[i])continue; if(x[i]-x[i-1]>mx) { mx=x[i]-x[i-1]; idx=i; } } vis[idx]=true; res-=mx-1; //cout<<"for k:"<<res<<endl; } cout<<res<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...