제출 #1180546

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1180546		asli_bg	Stove (JOI18_stove)	C++20	100 / 100	39 ms	3372 KiB

stove

#include<bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

#define int long long
//#define int double

typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<int> vi;
typedef vector<bool> vb;

#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)

#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pb push_back
#define sp <<" "<<

#define cont(x) for(auto el:x) cout<<el<<' ';cout<<endl;
#define contp(x) for(auto el:x) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;

#define DEBUG(x) cout<<#x sp x<<endl;
#define carp(x,y) ((x%MOD)*(y%MOD))%MOD
#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
#define mid (l+r)/2

const int MAXN=1e5+5;
const int MOD=1e9+7;
const int INF=1e18;

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n,k;
    cin>>n>>k;

    vii vec;

    vi a(n);
    FOR(i,n){
        cin>>a[i];
        if(i>0){
            vec.pb({a[i]-a[i-1],i});
        }
    }

    sort(all(vec));

    int ans=0;
    int cur=1;
    FORE(i,1,n){
        pii p={a[i]-a[i-1],i};
        auto it=lower_bound(all(vec),p)-vec.begin()+1;
        if(it>n-k){
            ans+=cur;
            cur=1;
            continue;
        }
        cur+=a[i]-a[i-1];
    }

    ans+=cur;
    cout<<ans<<endl;
}   

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