제출 #769361

#제출 시각아이디문제언어결과실행 시간메모리
769361borisAngelovStove (JOI18_stove)C++17
100 / 100
16 ms984 KiB
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

vector<int> laps;

void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int main()
{
    fastIO();

    int n, k;
    cin >> n >> k;

    int ans = n;

    int last;
    cin >> last;

    for (int i = 2; i <= n; ++i)
    {
        int x;
        cin >> x;

        laps.push_back(x - last - 1);

        last = x;
    }

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

    for (int i = 0; i < n - k; ++i)
    {
        ans += laps[i];
    }

    cout << ans << endl;

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