# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093889 | InvMOD | Stove (JOI18_stove) | C++14 | 16 ms | 2384 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>
using namespace std;
void solve()
{
int n,k; cin >> n >> k;
vector<int> T(n+1, 0);
for(int i = 1; i <= n; i++){
cin >> T[i];
}
int answer = (T[n] + 1) - T[1];
// don't count last time cause that's when JOI turn off
vector<int> minimize;
for(int i = 2; i <= n; i++){
// turn off at T[i-1] + 1, turn on again at T[i]
minimize.push_back(-((T[i]-1) - T[i-1]));
}
sort(minimize.begin(), minimize.end());
for(int i = 0; i < min((int)minimize.size(), k-1); i++){
if(!minimize[i]) break;
answer = answer + minimize[i];
}
cout << answer <<"\n";
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#define name "InvMOD"
if(fopen(name".INP", "r")){
freopen(name".INP", "r", stdin);
freopen(name".OUT", "w", stdout);
}
solve();
return 0;
}
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... |