# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
931083 | hugsfromadicto | Stove (JOI18_stove) | C++14 | 18 ms | 3444 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.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mxN = 1e5+1;
int a[mxN];
void _()
{
int n,k;
cin >> n >> k;
for(int i = 0; i < n; ++i)
cin >> a[i];
vector<int>v;
for(int i = 1; i < n; ++i)
{
v.push_back(a[i] - a[i - 1] - 1);
}
sort(v.begin(),v.end(),greater<int>());
int ans = a[n - 1] + 1 - a[0];
for(int i = 0; i < k - 1; ++i)
ans -= v[i];
cout << ans;
}
main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc = 1;
//cin>>tc;
while(tc--)
{
_();
}
}
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... |