Submission #502474

#	Time	Username	Problem	Language	Result	Execution time	Memory
502474		zorianka	Stove (JOI18_stove)	C++17	100 / 100	62 ms	1812 KiB

stove

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
 
using namespace std;
using ll = unsigned long long;
 
 
void solve() {
    int n, k;
    cin >> n >> k;
    int ans = n;
    int prev = 0;
    vector<int> aboba;
    for (int i = 0; i < n; i++) {
        int ti;
        cin >> ti;
        if (prev != 0)
            aboba.push_back(ti - prev - 1);
        prev = ti;
    }
    sort(aboba.begin(), aboba.end());
    for (int i = 0; i < n - k; i++)
        ans += aboba[i];
    cout << ans;
}
 
signed main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif
    int t = 1;
//    cin >> t;
    while (t--)
        solve();
    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50