제출 #1272475

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1272475		quanduongxuan12	Stove (JOI18_stove)	C++20	100 / 100	19 ms	1480 KiB

stove

#include <bits/stdc++.h>
using namespace std;
#define name "stove"
#define MAXN 100005
#define pb push_back
#define pf push_front
#define ll long long
#define ii pair<int, int>
#define fs first
#define sc second
#define ill pair<int, ll>
#define lli pair<ll, int>
#define llll pair<ll, ll>
#define all(v) v.begin(),v.end()
#define uni(v) v.erase(unique(all(v)),v.end())
#define bit(n,i) (((n)>>(i))&1)
#define FOR(i,a,b) for (int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for (int i=(a),_b=(b); i>=_b; i--)
#define MASK(i) (1LL<<(i))
const int INF=1e9;
const int MOD=1e9+7;
void add(int &u, int v){
    u+=v;
    if (u>=MOD) u-=MOD;
}
void sub(int &u, int v){
    u-=v;
    if (u<0) u+=MOD;
}
void minimize(int &u, int v){
    u=min(u,v);
}
void maximize(int &u, int v){
    u=max(u,v);
}
long long Rand(long long l, long long r){
    ll tmp=0;
    FOR(i,1,4) tmp=((tmp<<15)^(((1<<15)-1)&rand()));
    return l+tmp%(r-l+1);
}
int n,k,a[MAXN];
priority_queue<int> pq;
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    cin>>n>>k;
    FOR(i,1,n) cin>>a[i];
    FOR(i,1,n-1) pq.push(a[i+1]-a[i]-1);
    int ans=a[n]-a[1]+1;
    --k;
    while (k>0){
        --k;
        ans-=pq.top();
        pq.pop();
    }
    cout<<ans;
    return 0;
}

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