#include <stdio.h>
#include <stdlib.h>


int solve(){
    int ret;
    int n, q;
    
    if (scanf("%d %d", &n, &q) != 2) {
        return 0; 
    }
    
    
    int d[100];
    
    for (int i = 0; i < n; i++) {
        scanf("%d", &d[i]);
    }
    
    
    for (int i = 0; i < q; i++) {
        int max_val = -1;
        int max_idx = -1;
        
        for (int j = 0; j < n; j++) {
            if (d[j] > max_val) {
                max_val = d[j];
                max_idx = j;
            }
        }
        
        if (max_idx != -1) {
            d[max_idx] /= 2;
        }
    }
    
    int sum = 0;
    for (int i = 0; i < n; i++) {
        sum += d[i];
    }
    
    ret = sum;
   
    return ret;
}
int main(void){
    printf("%d\n",solve());
    return 0;
}