# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1033835 | vjudge1 | Stove (JOI18_stove) | C++11 | 38 ms | 3540 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>
const long long MAXN = 1e5 + 1;
using namespace std;
long long n, k, total_time = 0, skipped_time = 0;
long long a[MAXN];
vector<long long> gaps;
int main()
{
cin >> n >> k;
for (int i = 0; i < n; i ++)
{
cin >> a[i];
}
for (int i = 1; i < n; i ++)
{
gaps.push_back(a[i] - a[i - 1] - 1);
}
sort(gaps.begin(), gaps.end(), greater<long long>());
total_time = a[n - 1] - a[0] + 1;
for (int i = 0; i < k - 1 && i < gaps.size(); i ++)
{
skipped_time += gaps[i];
}
cout << total_time - skipped_time << "\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... |