Submission #1180257

#TimeUsernameProblemLanguageResultExecution timeMemory
1180257miniobStove (JOI18_stove)C++20
100 / 100
33 ms2300 KiB
#include <bits/stdc++.h>
using namespace std;

long long kiedy[100007];

int main()
{
    int n, k;
    cin >> n >> k;
    for (int i = 0; i < n; i++)
    {
        cin >> kiedy[i];
    }
    vector<long long> przer;
    for (int i = 0; i < n - 1; i++)
    {
        przer.push_back(kiedy[i+1] - kiedy[i] - 1);
    }
    sort(przer.begin(), przer.end());
    long long ile = n;
    for (int i = 0; i < n - k; i++)
    {
        ile += przer[i];
    }
    cout << ile << endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...