output_description: Print the minimum amount of money required to buy all the items.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N M
      A_1 A_2 ... A_N
attempt: a = [2, 3, 4]
  b = max(a)
  b = b / 2
  
  print(a)
  
problem_description: Statement
  
  Takahashi is going to buy N items one by one.
  
  The price of the i-th item he buys is A_i yen (the currency of Japan).
  
  He has M discount tickets, and he can use any number of them when buying an
  item.
  
  If Y tickets are used when buying an item priced X yen, he can get the item
  for \frac{X}{2^Y} (rounded down to the nearest integer) yen.
  
  What is the minimum amount of money required to buy all the items?
samples: [{"input": "3 3\n    2 13 8", "output": "9\n    \n\nWe can buy all the items for 9 yen, as follows:\n\n  * Buy the 1-st item for 2 yen without tickets.\n  * Buy the 2-nd item for 3 yen with 2 tickets.\n  * Buy the 3-rd item for 4 yen with 1 ticket.\n\n* * *"}, {"input": "4 4\n    1 9 3 5", "output": "6\n    \n\n* * *"}, {"input": "1 100000\n    1000000000", "output": "0\n    \n\nWe can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.\n\n* * *"}, {"input": "10 1\n    1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000", "output": "9500000000"}]