Submission #1301585

#TimeUsernameProblemLanguageResultExecution timeMemory
1301585hectormedranoStove (JOI18_stove)C++20
100 / 100
38 ms1992 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ll N, k, ans; cin>>N>>k; vector<ll> T(N), d(N-1); for(ll i=0;i<N;i++){ cin>>T[i]; } ans = T[N-1] + 1 - T[0]; for(ll i=1;i<N;i++){ d[i-1] = T[i] - (T[i-1] + 1); } //for(ll x : d){cout<<x<<endl;} sort(d.begin(), d.end()); for(ll i=N-2;i>=N-k;i--){ ans -= d[i]; } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...