백준 26215번 눈 치우기 C++

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

26215번: 눈 치우기

 

우선순위 큐를 사용해서 눈이 많이 쌓인 집부터 치움

 

#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 n;

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

    priority_queue<int> pq;
    cin >> n;
    for (int i = 0; i < n; i++) {
        int a;
        cin >> a;
        pq.push(a);
    }
    int ans = 0;
    while (!pq.empty()) {
        int a = pq.top();
        pq.pop();
        a -= 1;
        if (pq.empty() == false) {
            int b = pq.top();
            pq.pop();
            b -= 1;
            if (b > 0) pq.push(b);
        }
        if (a > 0) pq.push(a);
        ans++;
    }
    if (ans > 1440) ans = -1;
    cout << ans;
}