# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146080 | MathStudent2002 | Stove (JOI18_stove) | C++14 | 128 ms | 6052 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.
//wait darn
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef set<ll>::iterator slt;
ll st,fi;
multiset<ll> df;
ll K;
void input() {
int N; cin >> N >> K;
ll pre, cur;
for(int i = 0; i < N; i++) {
cin >> cur;
if(i == 0) st = cur;
else df.insert(pre-cur);
if(i == N-1) fi = cur+1;
else pre = cur+1;
}
}
void solve() {
K--;
ll ans = fi-st;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |