Submission #707670

#TimeUsernameProblemLanguageResultExecution timeMemory
707670Urvuk3Stove (JOI18_stove)C++17
100 / 100
24 ms2264 KiB
#include <bits/stdc++.h> using namespace std; #define EPS 1e-9 #define ll long long const int INF=1e9,mxN=5001; const ll LINF=1e18,MOD=1e9+7; #define fi first #define se second #define pii pair<int,int> #define pll pair<long long,long long> #define mid ((l+r)/2) #define sz(a) (int((a).size())) #define all(a) a.begin(),a.end() #define endl "\n" #define PRINT(x) cerr<<#x<<'='<<x<<endl; #define pb push_back #define PRINTvec(niz) { cerr<<#niz<<"="; for(auto _i:niz) cerr<<_i<<" "; cerr<<endl; } #define PRINTpair(x) cerr<<#x<<"={"<<x.fi<<","<<x.se<<"}"<<endl; void Solve(){ int N,K; cin>>N>>K; vector<int> a(N+1); for(int i=1;i<=N;i++) cin>>a[i]; sort(a.begin()+1,a.end()); int res=N,off=N; vector<int> b; for(int i=2;i<=N;i++){ b.pb(a[i]-a[i-1]-1); } sort(all(b)); for(int i=0;off>K;i++){ res+=b[i]; off--; } cout<<res<<endl; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int t; t=1; //cin>>t; while(t--){ Solve(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...