{"problem":{"name":"Powerful Discount Tickets","description":{"content":"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 a","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc141_d"},"statements":[{"statement_type":"Markdown","content":"Takahashi is going to buy $N$ items one by one.\nThe price of the $i$\\-th item he buys is $A_i$ yen (the currency of Japan).\nHe has $M$ discount tickets, and he can use any number of them when buying an item.\nIf $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.\nWhat is the minimum amount of money required to buy all the items?\n\n## Constraints\n\n*   All values in input are integers.\n*   $1 \\leq N, M \\leq 10^5$\n*   $1 \\leq A_i \\leq 10^9$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $M$\n$A_1$ $A_2$ $...$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc141_d","tags":[],"sample_group":[["3 3\n2 13 8","9\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."],["4 4\n1 9 3 5","6"],["1 100000\n1000000000","0\n\nWe can buy the item priced $1000000000$ yen for $0$ yen with $100000$ tickets."],["10 1\n1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000","9500000000"]],"created_at":"2026-03-03 11:01:14"}}