Submission #872069

#TimeUsernameProblemLanguageResultExecution timeMemory
872069I_FloPPed21Stove (JOI18_stove)C++14
100 / 100
38 ms2620 KiB
#include <iostream>
#include <bits/stdc++.h>
using namespace std;

long long n, k ;
long long v [ 200005 ];
int main()
{
    cin >> n >> k ;

    k --  ;

    long long sum = 0 ;
    priority_queue<int> pq;
    for( int i = 1; i <= n ; i ++ )
    {
        cin >> v[ i ];
        if ( i != 1 )
        {
            sum += ( v[ i ] - v[ i - 1 ] ) ;
            pq.push(v [ i ] - v[ i - 1 ] - 1 ) ;
        }

        //cout << sum<< '\n';
    }


    sum ++ ;
    for ( int i = 1; i <= min(k,n) ; i ++ )
        {

            sum -= pq.top();
            pq.pop();
        }

    cout << sum << '\n';
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...