For this Question: You enter a shop and there are N types of items with the i<sup>th</sup> item's price being p<sub>i</sub>. You also have A discount coupons. Suppose you use X amount of coupons on the i<sup>th</sup> item, its discounted price will be (p<sub>i</sub>/2<sup>X</sup>) rounded down to the nearest integer. Find the minimum price you will have to pay in order to buy one item of each type.The first line of the input contains two integers N and A.
The second line of the input contains N space seperated integers.

Constraints:
1 <= N <= 10<sup>5</sup>
1 <= p<sub>i</sub> <= 10<sup>9</sup>
1 <= A <= 10<sup>5</sup>Print the minimum price you will have to pay in order to buy one item of each type.Sample Input:
5 4
10 4 7 8 2

Sample Output:
15

Explaination:
You use 2 coupons on item 1, 1 coupon on item 3 and the last coupon on item 4.
This will make the price array of items as [2, 4, 3, 4, 2].
Total cost = 2 + 4 + 3 + 4 + 2 = 15, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
    public static void main (String[] args) {

        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int a = sc.nextInt();

        PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder());

        for(int i=0; i<n; i++) {
            int x = sc.nextInt();
            pq.add(x);
        }

        while(a-- > 0) {



            pq.add(pq.poll()/2);
        }

        long sum = 0;

        while(!pq.isEmpty()) {
            sum += pq.poll();
        }

        System.out.println(sum);
    }
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?