| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 595452 | Belphegor | Stove (JOI18_stove) | C++14 | 26 ms | 2336 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;
typedef long long ll;
int T[100005];
int main(){
ios_base::sync_with_stdio(false); cin.tie(NULL);
int n,k; cin>>n>>k;
for(int i=1; i<=n; i++) cin>>T[i];
priority_queue<int,vector<int>,less<int>>pq;
for(int i=1; i<n; i++) pq.push(T[i+1] - (T[i] + 1));
int ans = T[n] + 1 - T[1];
while(k>1){
--k;
ans-=pq.top();
pq.pop();
}
cout<<ans;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
