Submission #1089845

#TimeUsernameProblemLanguageResultExecution timeMemory
1089845FrostidianStove (JOI18_stove)C++14
0 / 100
1 ms344 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define endl "\n" const int MX = 1e5 + 5; int a[MX], sa = 0, n, k; priority_queue < int > pq; signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin >> n >> k; for ( int i = 1; i <= n; i++ ){ cin >> a[i]; if ( i >= 2 ) pq.push(a[i] - a[i - 1] - 1); sa += ( a[i] - a[i - 1] - 1 ); } for ( int i = 1; i <= k - 1; i++ ){ sa -= pq.top(); pq.pop(); } cout << sa + n << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...