Submission #1301536

#TimeUsernameProblemLanguageResultExecution timeMemory
1301536stas-badziStove (JOI18_stove)C++20
100 / 100
60 ms5108 KiB
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
int main() {
    int n,z;std::cin>>n>>z;
    std::set<int> s;
    for (int i=0;i<n;++i){int x;std::cin>>x;s.insert(x);}
    std::priority_queue<int, std::vector<int>,std::greater<int>> pq;
    while (s.size()>1) {
        auto top = *s.begin();
        s.erase(s.begin());
        pq.push(*s.begin()-top-1);
    }
    int res=n;
    while (z<pq.size()+1) {
        res+=pq.top();
        pq.pop();
    }
    std::cout << res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...