Submission #526074

#TimeUsernameProblemLanguageResultExecution timeMemory
526074benjaminkleynStove (JOI18_stove)C++17
100 / 100
21 ms2036 KiB
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

void solve()
{
    int n, k;
    cin >> n >> k;
    vector<int> t(n);
    for (int i = 0; i < n; i++)
        cin >> t[i];
    int time = n;
    sort(t.begin(), t.end());
    vector<int> dt(n-1);
    for (int i = 0; i < n - 1; i++)
        dt[i] = t[i+1] - (t[i] + 1);

    sort(dt.begin(), dt.end());
    for (int i = 0; i < n - k; i++)
        time += dt[i];

    cout << time;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...