제출 #947124

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
947124		steveonalex	Stove (JOI18_stove)	C++14	100 / 100	16 ms	3292 KiB

stove

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
    int n, k; cin >> n >> k;
    vector<ll> a(n);
    for(int i= 0; i<n; ++i) cin >> a[i];

    ll ans = a.back() - a[0] + k;
    k--;   
    vector<ll> diff;
    for(int i= 1; i<n; ++i) diff.push_back(a[i] - a[i-1]);

    sort(ALL(diff));

    while(k--) {ans -= diff.back(); diff.pop_back();}

    cout << ans << "\n";
 
    return 0;
}

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