#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.begin(), v.end(),greater<int>());
#define INF 999999999
#define MOD 1000000007
#define M_PI 3.14159265358979323846
#define ALL(X) (X).begin(),(X).end()

#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
#else
    #define DBG(X)
    #define SAY(X)
#endif

#ifdef __LOCAL
    #include <filesystem>
    namespace fs = std::filesystem;
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 0};
int dy[]={0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
 
std::string pad(int num){ char buffer[4]; std::snprintf(buffer, sizeof(buffer), "%03d", num); return buffer;}
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

// 愚直に実装したら間に合わないので工夫した。
// 実際はpriority_queueを使えばよかった。
// 以下のは、途中の計算を二分探索で簡略化してる。

int N,M;
vector<ll> A;
vector<int> Binal;

bool chb(int m){
  int x=0;
  for(int i=0;i<N;i++){
    x += max(0,Binal[i]-m);
  }
  return (x <= M);
}

void input(){
  #ifdef __LOCAL
    fs::path p = __FILE__;
    fs::path input,output;
    input = output = p.parent_path();
    input += string("/input/") + string(p.stem()) + string(".txt");
    output += string("/output/") + string(p.stem()) + string(".txt");
    freopen(input.c_str(), "r", stdin);
    freopen(output.c_str(), "w", stdout);
  #endif
  cin >> N >> M;
  A = fetch_vec<ll>(N);
}

void solve_1(){
  input();
  Binal.assign(N,0);
  for(int i=0;i<N;i++){
    for(int j=0;j<=32;j++)
      if(A[i] & (1LL<<j)) Binal[i] = j+1;
  }

  int l=0,r=31;
  while(l<r){
    int m = (l+r)/2;
    if(chb(m))
      r = m;
    else 
      l = m+1;
  }

  REP(i,N) Binal[i] = max(0,Binal[i]-l);
  REP(i,N) A[i] = (A[i] >> Binal[i]);
  int res = M-accumulate(ALL(Binal),0);

  VRSORT(A);
  for(int i=0;i<min(res,N);i++){
    A[i] = A[i]>>1LL;
  }

  cout << accumulate(ALL(A),0LL) << endl;
}

void solve_2(){
  input();
  priority_queue<ll> pque;
  for(int i=0;i<N;i++) pque.push(A[i]);
  for(int i=0;i<M;i++){
    ll tmp = pque.top()/2;
    pque.pop();
    pque.push(tmp);
  }
  ll sum=0;
  while(!pque.empty()){
    sum += pque.top();
    pque.pop();
  }
  cout << sum << endl;
}

int main()
{
  solve_2();
  return 0;
}


Measured memory_bytes: 2168