# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920369 | H1H | Stove (JOI18_stove) | C++17 | 17 ms | 2508 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>
#define T "Task"
using namespace std;
int n, k;
vector<int> a;
vector<int> d;
void ip(){
cin >> n >> k;
for(int i = 0; i < n; ++i){
int a1; cin >> a1;
a.push_back(a1);
if(i > 0)d.push_back(a1 - a[i-1]-1);
}
sort(d.begin(), d.end());\
int id = 0;
long long ans = n;
k -= n;
while(k < 0){
ans += d[id];
++id; ++k;
}
cout << ans;
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
if(fopen(T".INP", "r")){
freopen(T".INP", "r", stdin);
freopen(T".OUT", "w", stdout);
}
int tt = 1;
// cin >> tt;
while(tt--){
ip();
}
}
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... |