Submission #1214491

#TimeUsernameProblemLanguageResultExecution timeMemory
1214491candi_ositosStove (JOI18_stove)C++20
100 / 100
29 ms1096 KiB
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int N, K;
    cin>>N>>K;
    vector <int> t, d;
    t.resize(N);
    d.resize(N-1);
    for(int i=0; i<N; ++i)
    {
        cin>>t[i];
    }
    sort(t.begin(), t.end());
    for(int i=0; i<N-1; ++i)
    {
        d[i]=t[i+1]-t[i];
    }
    sort(d.begin(), d.end());
    int mt=N;
    for(int i=0; i<N-K; ++i)
    {
        mt+=d[i];
        --mt;
    }
    cout<<mt;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...