Submission #1217035

#TimeUsernameProblemLanguageResultExecution timeMemory
1217035moondarksideStove (JOI18_stove)C++20
100 / 100
35 ms1548 KiB
#include <iostream> #include<bits/stdc++.h> using namespace std; int main() { int n,k; cin>>n>>k; std::vector<int>Guests; for(int i=0;i<n;i++){ int a; cin>>a; Guests.push_back(a); } sort(Guests.begin(),Guests.end()); priority_queue<int>Holes; long long gas=1; for(int i=0;i<Guests.size()-1;i++){ gas++; int holeLen=Guests[i+1]-Guests[i]-1; gas+=holeLen; Holes.push(holeLen); } for(int i=0;i<k-1;i++){ gas-=Holes.top(); Holes.pop(); } cout<<gas; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...