Submission #979042

#TimeUsernameProblemLanguageResultExecution timeMemory
979042pit_smileStove (JOI18_stove)C++14
100 / 100
42 ms3596 KiB
#include<bits/stdc++.h> #define ll long long using namespace std; ll in[100005],out[100005],sum=0; priority_queue<int> keep; int main() { ll guest,open; cin >> guest >> open; for(int i=0;i<guest;i++) { cin >> in[i]; out[i]=in[i]+1; } for(int i=0;i<guest-1;i++) { //cout << in[i+1]-out[i] << " "; keep.push(in[i+1]-out[i]); } //cout << out[guest-1] << " " << in[0]; int tungmod=out[guest-1]-in[0]; //cout << tungmod << "\n"; open--; while(open--) { tungmod=tungmod-keep.top(); keep.pop(); } cout << tungmod; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...