| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1331226 | theem1502 | Stove (JOI18_stove) | C++20 | 1 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int num, can;
cin >> num >> can;
can--;
vector<int> thearray(num);
for (int i = 0; i < num; i++) {
cin >> thearray[i];
}
vector<int> gaps;
for (int i = 0; i < num - 1; i++) {
gaps.push_back(thearray[i+1] - thearray[i]);
}
sort(gaps.begin(), gaps.end(), greater<int> ());
int thenum = thearray[num - 1];
for (int i = 0; i < min(can, num); i++) {
thenum -= gaps[i] - 1;
}
cout << thenum;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
