Submission #522618

#	Time	Username	Problem	Language	Result	Execution time	Memory
522618		Mondeus	Stove (JOI18_stove)	C++17	100 / 100	32 ms	3204 KiB

stove

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <sstream>
#include <queue>
using namespace std;
const int maxn = 1e6;
long long a[maxn+5];
long long n,k;
priority_queue<long long> q;
void solve()
{
    cin >> n >> k;
    k--;
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    long long ans = a[n] - a[1] + 1;
    for(int i = 2; i <= n; i++)
        q.push(a[i]-a[i-1]-1);
    while(k--)
        ans -= q.top(), q.pop();
    cout << ans;

}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    solve();
    return 0;
}

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