# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
729345 |
2023-04-24T00:08:08 Z |
pcc |
Stove (JOI18_stove) |
C++14 |
|
1 ms |
316 KB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define fs first
#define sc second
void solve(){
ll n,k;
cin>>n>>k;
k = n-k;
ll arr[n];
for(auto &i:arr)cin>>i;
priority_queue<ll,vector<ll>,less<ll>> pq;
pq.push(0);
ll total = arr[n-1]+1;
for(int i = 1;i<n;i++)pq.push(arr[i]-arr[i-1]);
while(k--){
total -= pq.top();
pq.pop();
}
cout<<total;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int t = 1;
while(t--)solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
316 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
316 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
316 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |