Submission #888899

#TimeUsernameProblemLanguageResultExecution timeMemory
888899Art_ogoStove (JOI18_stove)C++17
100 / 100
43 ms2952 KiB
#include <bits/stdc++.h>

#define ve vector
#define ll long long
#define all(x) x.begin(), x.end()
using namespace std;

int main(){
    int n, k;
    cin >> n >> k;
    ve<ll> v(n);
    for(auto& i : v)
        cin >> i;
    sort(all(v));
    ll res = v.back() - v.front() + 1;
    ve<ll> a(n - 1);
    for(int i = 0; i < n - 1; i++)
        a[i] = v[i + 1] - v[i] - 1;
    sort(all(a), greater<ll>());
    for(int i = 0; i < k - 1; i++)
        res -= a[i];
    cout << res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...