Submission #1241942

#TimeUsernameProblemLanguageResultExecution timeMemory
1241942tavtdazStove (JOI18_stove)C++20
0 / 100
4 ms8004 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long int main () { ll n,t[1000001],k,kq=0; cin>>n>>k; for(int i=1;i<=n;i++) cin>>t[i]; sort(t+1,t+n+1); vector<ll> gap; for(int i=1;i<=n;i++) { gap.push_back(t[i]-t[i+1]-1); } ll s=t[n]+1-t[1]; sort(gap.begin(),gap.end(),greater<ll>()); ll skip=min(k-1,(ll)gap.size()); for(int i=0;i<skip;i++) { s-=gap[i]; } cout<<s; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...