Submission #1263449

#TimeUsernameProblemLanguageResultExecution timeMemory
1263449piolkStove (JOI18_stove)C++20
100 / 100
29 ms2340 KiB
#include <bits/stdc++.h> using namespace std; using ll=long long; int main(){ int n,k; cin>>n>>k; vector<ll> times(n); for (int i=0;i<n;i++){ cin>>times[i]; } ll base=times.back()-times.front()+1; vector<ll> gaps; for (int i=1;i<n;i++){ ll gap=times[i]-times[i-1]-1; gaps.push_back(gap); } sort(gaps.begin(),gaps.end()); for (int i=n-2;i>=n-k;i--){ base-=gaps[i]; } cout<<base; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...