Submission #1191797

#TimeUsernameProblemLanguageResultExecution timeMemory
1191797ani_lipartiaStove (JOI18_stove)C++20
100 / 100
32 ms1220 KiB
#include <bits/stdc++.h> using namespace std; const long long N = 1e5 + 5; int n, k, t[N]; long long s, ans; vector <int> v; bool f[N]; int main() { cin>>n>>k; for(int i = 1; i <= n; i++){ cin>>t[i]; if(i != 1) v.push_back(t[i] - t[i - 1] - 1); } sort(v.begin(), v.end()); reverse(v.begin(), v.end()); for(int i = 0; i < k - 1; i++) s += v[i]; ans = t[n] - t[1] + 1 - s; cout<<ans<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...