Submission #1331115

#TimeUsernameProblemLanguageResultExecution timeMemory
1331115krittaphotStove (JOI18_stove)C++20
100 / 100
15 ms2372 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, m;               
    cin >> n >> m;
    m--;                    

    vector<long long> t(n);
    for (int i = 0; i < n; i++) cin >> t[i];

    sort(t.begin(), t.end());   

    long long start = t.front();
    long long stop  = t.back();

    vector<long long> v;        
    for (int i = 1; i < n; i++) {
        v.push_back(t[i] - t[i - 1] - 1);
    }

    long long ans = stop - start + 1;

    if (m == 0) {            
        cout << ans;
        return 0;
    }

    sort(v.begin(), v.end(), greater<long long>());

    for (int i = 0; i < m && i < (int)v.size(); i++) {
        ans -= v[i];
    }

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