Submission #504967

#TimeUsernameProblemLanguageResultExecution timeMemory
504967Andy__Andy__Stove (JOI18_stove)C++17
100 / 100
51 ms2336 KiB
#include <bits/stdc++.h> #define ll long long //#define int ll using namespace std; ifstream f ("test.in"); ofstream g ("test.out"); priority_queue < int > q; int main() { int n,k; cin>>n>>k; vector < int > v(n+5); for(int i=1;i<=n;++i) { cin>>v[i]; } if(n == k) { cout<<n; return 0; } for(int i=1;i<n;++i) { q.push( (v[i+1]-v[i]-1) ); } int ans = v[n]-v[1]+1; k--; while(k--) { int x = q.top(); ans -=x; q.pop(); } cout<<ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...