Submission #516475

#TimeUsernameProblemLanguageResultExecution timeMemory
516475AJ00Stove (JOI18_stove)C++17
100 / 100
21 ms2388 KiB
#include <bits/stdc++.h>
using namespace std;
long long int a[100000];
vector<long long int> vec;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    long long int t=1,n,k,gaps,ans; 
    //cin >> t; 
    while (t--){
        cin >> n >> k; 
        for (int i = 0; i < n; i++){
            cin >> a[i];
        }
        for (int i = 1; i < n; i++){
            vec.push_back(a[i]-a[i-1]);
        }
        sort(vec.begin(),vec.end());
        gaps = n-k;
        ans = 0;
        for (int i = 0; i < gaps; i++){
            ans += vec[i]; 
        }
        ans += n;
        ans -= gaps;
        cout << ans << "\n";
    }
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...