# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
996171 | faqinyeager | Stove (JOI18_stove) | C++17 | 95 ms | 12484 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;
using ll = long long;
int n, k;
vector<ll> t;
int main(){
cin >> n >> k;
t.resize(n);
for(int i = 0; i < n; i++) cin >> t[i];
if(n <= k){
cout << n;
return 0;
}
vector<pair<ll, pair<ll, ll>>> pos(n - 1);
for(int i = 0; i < n - 1; i++){
int p = t[i + 1] - t[i];
pos[i].first = p;
pos[i].second = {i, i + 1};
}
sort(pos.begin(), pos.end());
vector<pair<pair<ll, ll>, ll>> tmp;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |