제출 #441053

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
441053		julian33	Stove (JOI18_stove)	C++14	100 / 100	29 ms	2324 KiB

stove

#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
    cerr<<vars<<" = ";
    string delim="";
    (...,(cerr<<delim<<values,delim=", "));
    cerr<<"\n";
}
#else
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {}
#endif

#define pb push_back
#define sz(x) (int)(x.size())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> inline void maxa(T& a,T b){a=max(a,b);}
template<typename T> inline void mina(T& a,T b){a=min(a,b);}


int main(){
    cin.sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    #ifdef LOCAL
        freopen("input.txt","r",stdin);
        freopen("output.txt","w",stdout);
    #endif

    int n,k; cin>>n>>k;
    ll ans=0;
    vector<int> a(n);
    for(int &i:a)
        cin>>i;
    sort(a.begin(),a.end());
    priority_queue<int,vector<int>,greater<int>> q;
    for(int i=1;i<n;i++)
        q.push(a[i]-a[i-1]-1);
    for(;k<n;k++){
        ans+=q.top(); q.pop();
    }
    cout<<ans+n<<"\n";
}

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