# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
415867 | Anish_Bashyal | Stove (JOI18_stove) | C++17 | 81 ms | 6380 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main() {
int n,k;
cin >> n >> k;
multiset<int,greater<int>> s;
int t[n];
for(int i=0;i<n;i++){
cin >> t[i];
}
k--;
int ans=t[n-1]-t[0]+1;;
for(int i=0;i<n-1;i++) {
int dt=t[i+1]-t[i]-1;
//cout << "dt " <<dt << "\n";
s.insert(t[i+1]-t[i]-1);
}
for(auto i:s){
if(k--==0) break;
ans-=i;
}
cout << ans<<"\n";
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |