using System;
using System.Collections.Generic;
using System.Collections;
using System.Collections.Specialized;
using System.Linq;
using System.Text;
using System.IO;
using System.Reflection;
using static System.Math;
using System.Numerics;
static class Program{
	const int mod=(int)1e9+7;
	static void Main(){
		Sc sc=new Sc();
		var s=sc.Ia;
		var a=sc.Ia;
		var pq=new Fheap<int>(s[0]+s[1],false);
		for(int i = 0;i<s[0];i++) {
			pq.Push(a[i]);
		}
		while(s[1]>0&&pq.cnt>0){
			var e=pq.Dequeue;
			pq.Push(e.n>>1);
			s[1]--;
		}
		long ans=0;
		while(pq.cnt>0){
			ans+=pq.Dequeue.n;
		}
		Console.WriteLine("{0}",ans);
	}
}
public class Fheap<T> where T:IComparable{
	public class Nd{
		public T n;
		public List<Nd> li=new List<Nd>();
		public Nd(T n){this.n=n;}
	}
	public Nd[] h;
	public Nd top;
	public int cnt=0;
	private Func<Nd,Nd,int> compare;
	private int Ao(Nd x,Nd y){return y.n.CompareTo(x.n);}
	private int Do(Nd x,Nd y){return x.n.CompareTo(y.n);}
	public Fheap(int n,bool mm){
		int l=(int)Log(n,2)+1;
		h=new Nd[l];
		if(mm){compare=Ao;}
		else{compare=Do;}
	}
	public void Push(T x){
		var e=new Nd(x);
		while(h[e.li.Count]!=null){
			if(compare(e,h[e.li.Count])>=0){e.li.Add(h[e.li.Count]);}
			else{
				h[e.li.Count].li.Add(e);
				e=h[e.li.Count];
			}
			h[e.li.Count-1]=null;
		}
		h[e.li.Count]=e;
		if(top==null||compare(e,top)>=0){top=e;}
		cnt++;
	}
	public Nd Dequeue{
		get{
			var d=top;
			h[d.li.Count]=top=null;
			for(int i = 0;i<d.li.Count;i++) {
				var e=d.li[i];
				while(h[e.li.Count]!=null){
					if(compare(e,h[e.li.Count])>=0){e.li.Add(h[e.li.Count]);}
					else{
						h[e.li.Count].li.Add(e);
						e=h[e.li.Count];
					}
					h[e.li.Count-1]=null;
				}
				h[e.li.Count]=e;
			}
			for(int i = 0;i<h.Length;i++) {
				if(top==null||(h[i]!=null&&compare(h[i],top)>=0)){top=h[i];}
			}
			cnt--;
			return d;
		}
	}
}
public class Sc{
	public int I{get{return int.Parse(Console.ReadLine());}}
	public long L{get{return long.Parse(Console.ReadLine());}}
	public double D{get{return double.Parse(Console.ReadLine());}}
	public string S{get{return Console.ReadLine();}}
	public int[] Ia{get{return Array.ConvertAll(Console.ReadLine().Split(),int.Parse);}}
	public long[] La{get{return Array.ConvertAll(Console.ReadLine().Split(),long.Parse);}}
	public double[] Da{get{return Array.ConvertAll(Console.ReadLine().Split(),double.Parse);}}
	public string[] Sa{get{return Console.ReadLine().Split();}}
	public object[] Oa{get{return Console.ReadLine().Split();}}
	public int[] Ia2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),int.Parse);}}
	public int[] Ia3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),int.Parse);}
	public int[] Ia3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split(),int.Parse);}
	public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),long.Parse);}}
	public long[] La3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),long.Parse);}
	public long[] La3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split(),long.Parse);}
	public T[] Arr<T>(int n,Func<T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f();}return a;}
	public T[] Arr<T>(int n,Func<int,T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i);}return a;}
	public T[] Arr<T>(int n,Func<string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(Console.ReadLine().Split());}return a;}
	public T[] Arr<T>(int n,Func<int,string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i,Console.ReadLine().Split());}return a;}
}

Measured memory_bytes: 50912