Submission #306317

#TimeUsernameProblemLanguageResultExecution timeMemory
306317baibhav26062008Stove (JOI18_stove)C++14
100 / 100
102 ms3816 KiB
#include <iostream> #include <vector> #include <algorithm> #define int long long signed main() { int n , k; std::cin >> n >> k; std::vector <int> a(n) , d(n); for (int i = 0;i < n;i++) { std::cin >> a[i]; } int ans = a.back() - a[0] + 1; for (int i = 1;i < n;i++) { d.push_back(a[i] - a[i-1] - 1); } std::sort(d.rbegin(),d.rend()); for (int i = 0;i < k - 1;i++) { ans -= d[i]; } std::cout << ans << std::endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...