문제가 좀 난해함 =_=
지피티 친구랑 열심히 풀어봄
class Solution:
def minOperations(self, nums: List[int], k: int) -> int:
cnt = 0
s = sorted(set(nums), reverse=True)
while s and s[0] > k:
h = s[1] if len(s) > 1 else k
nums = [min(x, h) for x in nums]
cnt += 1
s = sorted(set(nums), reverse=True)
return cnt if all(x == k for x in nums) else -1