제출 #1180738

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1180738		Zbyszek99	Stove (JOI18_stove)	C++20	100 / 100	13 ms	1988 KiB

stove

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define vl vector<long long>
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;


int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random();
    int n,k;
    cin >> n >> k;
    vi arr(n);
    rep(i,n) cin >> arr[i];
    sort(all(arr));
    ll ans = arr[n-1] - arr[0]+1;
    vl gaps;
    rep(i,n-1)
    {
        gaps.pb(max(0,arr[i+1]-arr[i]-1));
    }   
    sort(all(gaps));
    reverse(all(gaps));
    rep(i,min(k-1,n-1))
    {
        ans -= gaps[i];
    }
    cout << ans;
}

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