제출 #521881

#제출 시각아이디문제언어결과실행 시간메모리
521881MonarchuwuStove (JOI18_stove)C++17
100 / 100
22 ms2048 KiB
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;

const int N = 1e5 + 9;
int n, k, t[N], d[N];

int main() {
    cin.tie(NULL)->sync_with_stdio(false);
    cin >> n >> k;
    for (int i = 1; i <= n; ++i) {
        cin >> t[i];
        d[i - 1] = t[i] - t[i - 1] - 1;
    }
    sort(d + 1, d + n, greater<int>());

    ll res(n);
    for (int i = k; i < n; ++i) res += d[i];
    cout << res << '\n';
}
/**  /\_/\
 *  (= ._.)
 *  / >0  \>1
**/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...