Submission #1153457

#TimeUsernameProblemLanguageResultExecution timeMemory
1153457spycoderytStove (JOI18_stove)C++20
100 / 100
32 ms1220 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n,k,ans; cin>>n>>k; vector<int> v(n); if(n==1){ cout << 1; return 0; } priority_queue<int> pq; for(int i = 0;i<n;i++) { cin>>v[i]; if(i>=1)pq.push(v[i] - v[i-1] - 1); } ans = v[n-1] - v[0] + 1; k--; while(k--)ans-=pq.top(),pq.pop(); cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...