Submission #870991

#TimeUsernameProblemLanguageResultExecution timeMemory
870991marcidStove (JOI18_stove)C++17
100 / 100
14 ms1808 KiB
#ifndef LOCAL #pragma GCC optimize ("Ofast") #pragma GCC optimize ("unroll-loops") #endif #include <bits/stdc++.h> using namespace std; int main() { cin.tie(0)->sync_with_stdio(false); cout.tie(0); int n, k; cin >> n >> k; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int i = 0; i < n-1; i++) { a[i]=a[i+1]-a[i]-1; } int sum = n; sort(a, a+n); for (int i = 0; i < n-k; i++) { sum += a[i]; } cout << sum; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...