SOLUTION INFO
C++ · main.cpp
class Solution {
public:
int minOperations(vector<int>& nums, int k) {
priority_queue<long long, vector<long long>, greater<>> pq(nums.begin(), nums.end());
int ans = 0;
while(pq.top() < k) {
++ ans;
long long a = pq.top(); pq.pop();
long long b = pq.top(); pq.pop();
pq.push(min(a, b) * 2 + max(a, b));
}
return ans;
}
};
SOLUTION DESCRIPTION
풀이 설명
등록된 풀이 설명이 없습니다.