Submission #1333572

#TimeUsernameProblemLanguageResultExecution timeMemory
1333572gelastropodStove (JOI18_stove)C++20
100 / 100
13 ms1476 KiB
#pragma GCC optimize("O3,inline")
#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int N, K, x; cin >> N >> K;
    vector<int> T;
    for (int i = 0; i < N; i++) {
        cin >> x;
        T.push_back(x);
    }
    for (int i = 0; i < N - 1; i++) T[i] -= T[i + 1];
    T.pop_back();
    sort(T.begin(), T.end());
    int ans = N;
    for (int i = K; i < N; i++) ans -= T[N - 2 - (i - K)] + 1;
    cout << ans << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...