Submission #1228761

#TimeUsernameProblemLanguageResultExecution timeMemory
1228761haiduongStove (JOI18_stove)C++20
0 / 100
0 ms324 KiB
#include<bits/stdc++.h> using namespace std; #define int long long int const N=2e5+10; int g[N]; int t[N]; vector<int> ok; int32_t main() { cin.tie(0)->sync_with_stdio(false); int n,k; cin>>n>>k; int l=0; for(int i=1;i<=n;i++){ cin>>t[i]; l=max(l,t[i]); } // cout<<l; int bat=1; ///luon bat o thoi diem ban dau for(int i=1;i<=n;i++){ g[i]=max(g[i],t[i+1]-(t[i]+1)); if(g[i]>0){ ok.push_back(g[i]); } } sort(ok.begin(),ok.end(),greater<int>()); // for(auto x:ok) cout<<x<<" "; for(auto x:ok){ bat++; if(bat<=k){ l-=x; } } cout<<l<<" "; if(bat==1) cout<<l; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...