| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1369716 | c12 | Stove (JOI18_stove) | C++20 | 26 ms | 1568 KiB |
#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n,k;
cin >> n >> k;
k--;
vector<int>cost(n-1);
vector<int>vec(n);
for(int i = 0;i < n;i++) cin >> vec[i];
for(int i = 0;i < n-1;i++) cost.push_back(vec[i+1]-vec[i]-1);
sort(cost.begin(),cost.end());
int sum = n;
for(int i = 0;i < cost.size()-k;i++){
sum += cost[i];
}
cout << sum;
} | # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
