Submission #888263

#	Time	Username	Problem	Language	Result	Execution time	Memory
888263		Marco_Escandon	Stove (JOI18_stove)	C++11	100 / 100	19 ms	3292 KiB

stove

#include<bits/stdc++.h>
using namespace std;
#define optimizar_io ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout.setf(ios::fixed);cout.precision(0);
#pragma GCC optimize("Ofast")
typedef long long ll;
#define double long double 
int main()
{
    optimizar_io
    ll n,m;
    cin>>n>>m;
    ll cad[n];
    priority_queue<ll> q;
    for(int i=0; i<n; i++)
    {
        cin>>cad[i];
        if(i>0)
        {
            q.push(cad[i]-cad[i-1]-1);
        }
    }
    ll cont=cad[n-1]-cad[0]+1;
    for(int i=0; i<m-1; i++)
    {
        //cout<<cont;
        cont-=q.top();
        q.pop();
    }
    cout<<cont;
    return 0;
}

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