Submission #370532

#TimeUsernameProblemLanguageResultExecution timeMemory
370532FystyStove (JOI18_stove)C++17
100 / 100
51 ms3192 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<ll,ll> pll; #define rep(i,n) for(int i=0;i<n;i++) #define rep1(i,n) for(int i=1;i<n;i++) #define F first #define S second #define pb push_back int main() { ll n,k; cin>>n>>k; vector<ll> a(n),tmp; rep(i,n) cin>>a[i]; ll tot=a[n-1]+1-a[0]; rep(i,n-1) { tmp.pb(a[i+1]-a[i]-1); } sort(tmp.begin(),tmp.end(),greater<ll>()); rep(i,k-1) tot-=tmp[i]; cout<<tot; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...