Submission #533187

#	Time	Username	Problem	Language	Result	Execution time	Memory
533187		browntoad	Stove (JOI18_stove)	C++14	100 / 100	18 ms	2764 KiB

stove

#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
 
const ll inf = (1ll<<60);
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=5005;
const double PI=acos(-1);
 
ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}
 
ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}
signed main(){
    IOS();
    int n,k; cin>>n>>k;
    vector<int> vc(n);
    REP(i,n){
        cin>>vc[i];
    }
    if (n==1){
        cout<<1<<endl;
        return 0;
    }
    vector<int> dif(n-1);
    REP(i,n-1){
        dif[i]=vc[i+1]-vc[i];
    }
    sort(ALL(dif));
    int ans=vc[n-1]-vc[0];
    REP(i,k-1){
        ans-=dif[SZ(dif)-i-1];
    }
    cout<<ans+k<<endl;
}
/*
1
43
*/

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