Submission #932308

#TimeUsernameProblemLanguageResultExecution timeMemory
932308ntminStove (JOI18_stove)C++14
100 / 100
19 ms2360 KiB
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
#define fi first
#define sc second

const int N = 1e5 + 1;
int n, k, a[N];

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    cin >> n >> k;
    for(int i = 1; i <= n; ++i) cin >> a[i];

    int ans = a[n] + 1 - a[1];
    priority_queue<int> q;
    for(int i = 1; i < n; ++i){
        q.push(a[i + 1] - a[i] - 1);
    }
    for(int i = 1; i < k; ++i){
        ans -= q.top();
        q.pop();
    }

    cout << ans;

    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...