백준 19638번 센티와 마법의 뿅망치 C++

https://www.acmicpc.net/problem/19638

19638번: 센티와 마법의 뿅망치

 

우선순위 큐

 

#include <iostream>
#include <string>
#include <vector>
#include <math.h>
#include <algorithm>
#include <utility>
#include <stack>
#include <queue>
#include <math.h>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <limits.h>

using namespace std;
using int64 = long long;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    priority_queue<int> pq;

    int n, h, t;
    cin >> n >> h >> t;
    for (int i = 0; i < n; i++) {
        int hh;
        cin >> hh;
        pq.push(hh);
    }
    int cnt = 0;
    while (true) {
        if (pq.top() == 1 || pq.top() < h) break;
        if (cnt >= t) break;
        int curr = pq.top();
        pq.pop();
        pq.push(curr / 2);
        cnt++;
    }
    if (pq.top() < h) {
        cout << "YES\n" << cnt;
    }
    else {
        cout << "NO\n" << pq.top();
    }
}