제출 #940356

#제출 시각아이디문제언어결과실행 시간메모리
940356codefoxStove (JOI18_stove)C++14
100 / 100
49 ms1780 KiB
#include<bits/stdc++.h>

using namespace std;

int main()
{
    int n, k;
    cin >> n >> k;

    vector<int> dist(n-1);
    int last;
    cin >> last;
    for (int i= 1; i < n; i++)
    {
        int t;
        cin >> t;
        dist[i-1] = t-last-1;
        last = t;
    }

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

    int sol = n;
    for (int i = 0; i < n-k; i++) sol += dist[i];
    cout << sol << "\n";

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