import math
import sys

def getMinimumChanges(fileSize, minSize):
    n = len(fileSize)
    s_list = []
    t_def = 0
    g_chg = 0

    for f, m in zip(fileSize, minSize):
        s = f - m
        if s < 0:
            g_chg += 1
            t_def += abs(s)
        else:
            s_list.append(s)

    if sum(s_list) < t_def:
        return -1

    s_list.sort(reverse=True)
    p_chg = 0
    rem_def = t_def

    for s in s_list:
        if rem_def > 0:
            rem_def -= s
            p_chg += 1
        else:
            break

    return g_chg + p_chg

import sys
import math

def getMinOperations(kValues):
    res = []
    for k in kValues:
        if k == 0:
            res.append(0)
            continue
        ops = 0
        while k > 0:
            if k % 2 == 0:
                k //= 2
            else:
                k -= 1
            ops += 1
        res.append(ops)
    return res

Placement Help available...

Test Clearance Guarantee ❤️

Experian Slots are available