Submission #547190

#	Time	Username	Problem	Language	Result	Execution time	Memory
547190		beedle	Stove (JOI18_stove)	C++17	100 / 100	20 ms	3156 KiB

stove

#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <set>
#include <iterator>
#include <stack>
#include <map>
#include <math.h>
#include <bitset>
#include <deque>
#include <string>
#include <tuple>
#include <queue>
#include <numeric>
#include <unordered_set>
#include <unordered_map>
#define pi 3.141592653589793238
#define ll long long
#define ld long double
#define rep(i, a, b) for (long long i = a; i <= b; i++)
#define mod 1000000007ll
#define INF 1000000000000000000
#define pb push_back
#define ff first
#define ss second
#define endl '\n'
#define all(x) (x).begin (), (x).end ()
#define sz(x) (ll) (x).size ()
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define rank rnk
#define log lg
#define fast                                                                  \
    ios_base::sync_with_stdio (false);                                        \
    cin.tie (NULL);                                                           \
    cout.tie (NULL)
 
using namespace std;

signed main()
{
    fast;

    // freopen("milkorder.in","r",stdin);
    // freopen("milkorder.out","w",stdout);

    ll n,k;
    cin>>n>>k;

    ll arr[n+1];
    rep(i,1,n)
    cin>>arr[i];

    vector <ll> del;
    rep(i,2,n)
    del.pb(-arr[i]+arr[i-1]);

    sort(all(del));

    ll ans=arr[n]-arr[1]+k;
    rep(i,0,k-2)
    ans+=del[i];

    cout<<ans;
    
    return 0;
}

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