Submission #1050722

#TimeUsernameProblemLanguageResultExecution timeMemory
1050722fryingducStove (JOI18_stove)C++17
100 / 100
12 ms2288 KiB
#include "bits/stdc++.h"
using namespace std;

const int maxn = 1e5 + 5;

int n, k;
int a[maxn];
void solve() {
    cin >> n >> k;
    vector<int> b;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    for(int i = 1; i < n; ++i) {
        b.push_back(a[i] - a[i + 1]);
    }
    sort(b.begin(), b.end());
    
    long long ans = a[n] - a[1] + k;
    for(int i = 0; i < k - 1; ++i) {
        ans += b[i];
    }
    
    cout << ans;
}
signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    
    solve();
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...