제출 #1228746

#제출 시각아이디문제언어결과실행 시간메모리
1228746haiduongStove (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; signed main() { cin.tie(0)->sync_with_stdio(false); int n,k; cin>>n>>k; int l=n; for(int i=1;i<=n;i++){ cin>>t[i]; } 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()); // for(auto x:ok) cout<<x<<" "; for(int i=0;i<n-k&&i<ok.size();i++){ l+=ok[i]; } cout<<l<<" "; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...