long eqalize(vector<long>power)
{
  int n = power.size();
  sort(power.begin(), power.end());
  long val = 0;
  if (n % 2 == 1) {
    val = power[n / 2];
  }
  else {
    val = (power[(n - 1) / 2] + power[n / 2]) / 2;
  }
  long res = 0;
  for (long i = 0; i < n; ++i)
  {
    res += abs(power[i] - val);
  }
  return res;
}

SELECT 
    ROUND(
        (COUNT(CASE WHEN polygon_name = 'Adarsh Palm Retreat' THEN 1 END) * 100.0) / 
        COUNT(*),
        2
    ) AS order_share
FROM 
    POLYGON
WHERE 
    order_date = '2020-12-31';

SELECT 
    'within 100' AS BUCKET,
    COUNT(*) AS Orders
FROM cuisine_orders
WHERE item_total <= 100

UNION ALL

SELECT 
    'within 150' AS BUCKET,
    COUNT(*) AS Orders
FROM cuisine_orders
WHERE item_total <= 150

UNION ALL

SELECT 
    'within 200' AS BUCKET,
    COUNT(*) AS Orders
FROM cuisine_orders
WHERE item_total <= 200

ORDER BY BUCKET;

def minMoves(h, w, h1, w1):
    if h1 > h or w1 > w:
        return -1
    moves = 0
    while h > h1:
        h = (h + 1) // 2
        moves += 1 
    while w > w1:
        w = (w + 1) // 2
        moves += 1 
    return moves

def maxPosPrefixes(arr):
    arr.sort(reverse=True)
    prefix_sum = 0
    positive_count = 0
    for num in arr:
        prefix_sum += num
        if prefix_sum > 0:
            positive_count += 1
        else:
            break  
    return positive_count