Submission #520345

#TimeUsernameProblemLanguageResultExecution timeMemory
520345new_accStove (JOI18_stove)C++14
100 / 100
23 ms2884 KiB
#include<bits/stdc++.h> #define fi first #define se second #define rep(a, b) for(int a = 0; a < (b); a++) using namespace std; typedef long long ll; typedef vector<ll> vi; typedef vector<ll> vl; const int N=1e6+10; int t[N]; void solve(){ int n,k; cin>>n>>k; rep(i,n) cin>>t[i]; vi v; sort(t,t+n); ll curr=0; curr=t[n-1]-t[0]+1; for(int i=1;i<n;i++) v.push_back(t[i]-t[i-1]-1); sort(v.begin(),v.end()); for(int i=v.size()-1;i>max(-1,(int)v.size()-k);i--) curr-=v[i]; cout<<curr<<"\n"; } int main(){ ios_base::sync_with_stdio(0),cin.tie(0); solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...