Submission #1164817

#TimeUsernameProblemLanguageResultExecution timeMemory
1164817JahonaliXStove (JOI18_stove)C++20
100 / 100
44 ms5448 KiB
#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, k, m;
    cin >> n >> k;
    vector<int> t(n);
    for (int &i : t) cin >> i;
    sort(t.begin(), t.end());
    multiset<int> s;
    for (int i = 1; i < n; ++i) s.insert(t[i] - t[i - 1] - 1);
    m = n;
    n -= k;
    while (n--) m += *s.begin(), s.erase(s.begin());
    cout << m;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...