# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
255010 | shrek12357 | Stove (JOI18_stove) | C++14 | 74 ms | 2648 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 <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <set>
#include <climits>
#include <cmath>
#include <fstream>
#include <queue>
using namespace std;
bool comp(int a, int b) {
return a > b;
}
int main() {
int n, k;
cin >> n >> k;
vector<int> times;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
times.push_back(temp);
}
sort(times.begin(), times.end());
int tot = 1;
vector<int> diff;
for (int i = 1; i < times.size(); i++) {
diff.push_back(times[i] - times[i - 1]);
tot += times[i] - times[i - 1];
}
sort(diff.begin(), diff.end(), comp);
for (int i = 0; i < k - 1; i++) {
tot -= diff[i];
tot++;
}
cout << tot << endl;
}
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... |