Powerful Discount Tickets AtCoder - 4864

Powerful Discount Tickets

Problem Statement

Takahashi is going to buy N items one by one.

The price of the i-th item he buys is Ai 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

X

2Y

(rounded down to the nearest integer) yen.

What is the minimum amount of money required to buy all the items?

Constraints

• All values in input are integers.
• 1≤N,M≤105
• 1≤Ai≤109

Input

Input is given from Standard Input in the following format:

N M
A1 A2 … AN

Output

Print the minimum amount of money required to buy all the items.

Sample Input 1

3 3
2 13 8

Sample Output 1

9

We can buy all the items for 9 yen, as follows:

• Buy the 1-st item for 2 yen without tickets.
• Buy the 2-nd item for 3 yen with 2 tickets.
• Buy the 3-rd item for 4 yen with 1 ticket.

Sample Input 2

4 4
1 9 3 5

Sample Output 2

6

Sample Input 3

1 100000
1000000000

Sample Output 3

0

We can buy the item priced 1000000000 yen for 0 yen with 100000 tickets.

Sample Input 4

10 1
1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000

Sample Output 4

9500000000

题意：有n件商品m张卷，一张券的作用就是使一件商品目前的价格打五折，问用完券之后最少可以花多少钱买到这n件商品。

思路：就是每次将卷用到最贵的商品上，这样减少的钱是最多的，那么最后花掉的钱是最少的。

这道题可以用优先队列防止超时。

#include<iostream>
#include<queue>
using namespace std;
priority_queue<int> qe;
int n,m;
long long x;
int main(){
	cin>>n>>m;
	for(int i=0;i<n;i++){
		cin>>x;
		qe.push(x);
	}
	long long sum=0;
	for(int i=0;i<m;i++){
		if(!qe.empty()){
			int t=qe.top();
		t/=2;
		qe.pop();
		qe.push(t);
		}
	}
	while(!qe.empty()){
		sum+=qe.top();
		qe.pop();
	}
	cout<<sum<<endl;
	return 0;
}