Submission #164448

#TimeUsernameProblemLanguageResultExecution timeMemory
164448aggu_01000101Stove (JOI18_stove)C++14
100 / 100
84 ms2548 KiB
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(){
    int n, k;
    cin>>n>>k;
    int t[n];
    for(int i =0;i<n;i++){
        cin>>t[i];
    }
    vector<int> edges;
    for(int i = 1;i<n;i++){
        edges.push_back(t[i] - t[i-1]-1);
    }
    sort(edges.begin(), edges.end());
    int total = 0;
    for(int i = 0;i<n-k;i++){
        total+=edges[i];
    }
    total+=n;
    cout<<total<<endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...