package main

import (
	"bufio"
	"bytes"
	"fmt"
	"io"
	"os"
	"strconv"
)

// -----------------------------------------------------------------------------
// IO helper functions

// Returns next token from input.  It must be initialized by SetInput()
// before the key call.
var nextToken func() ([]byte, error)

// OutputBuffer Holds a buffer for output.  It must be initialized by SetOutput().
// All IO fucntions (read*() and [e]print*()) should write to OutputWriter
// instead of this.
var OutputBuffer *bufio.Writer

// OutputWriter Holds an io.Writer.  It must be initialized by SetOutput()
var OutputWriter io.Writer

// SetInteractive SetInteractive Set IO functions for interactive input/output.
func SetInteractive(w io.Writer, r io.Reader) {
	SetUnbefferedInput(r)
	OutputBuffer = nil
	OutputWriter = w
}

// SetOutput Setup OutputBuffer and OutputWriter.
func SetOutput(w io.Writer) {
	OutputBuffer = bufio.NewWriter(w)
	OutputWriter = OutputBuffer
}

// Flush Flushes OutputBuffer
func Flush() {
	if OutputBuffer != nil {
		OutputBuffer.Flush()
	}
}

// IsSpace Returns true if c is a white space
func IsSpace(c byte) bool {
	switch c {
	case '\t', '\n', '\v', '\f', '\r', ' ':
		return true
	}
	return false
}

// SetInput Setup nextToken with input buffer.
func SetInput(r io.Reader) {
	buf := new(bytes.Buffer)
	var b []byte

	var i int
	rest := func() ([]byte, error) {
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		if i == j {
			return nil, io.ErrUnexpectedEOF
		}
		return b[j:i], nil
	}
	initial := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextToken = rest
		return rest()
	}
	nextToken = initial
}

// SetUnbefferedInput Setup nextToken without input buffer.
func SetUnbefferedInput(r io.Reader) {
	buf := bufio.NewReader(r)
	var b []byte

	var i int
	nextToken = func() ([]byte, error) {
		var err error
		if i == len(b) {
			b, err = buf.ReadBytes('\n')
			if err != nil {
				return nil, err
			}
			i = 0
			j := len(b) - 1
			for 0 <= j && IsSpace(b[j]) {
				j--
			}
			b = b[0 : j+1]
		}
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		if i == j {
			return nil, io.ErrUnexpectedEOF
		}
		return b[j:i], nil
	}
}

// -----------------------------------------------------------------------------

// IO functions

// Reads next token and return it as []byte
func readb() []byte {
	b, err := nextToken()
	if err != nil {
		panic(err)
	}
	return b
}

// Reads next token and return it as string
func reads() string {
	return string(readb())
}

// Reads next token and return it as int64
func readll() int64 {
	i, err := strconv.ParseInt(reads(), 10, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

// Reads next token and return it as int
func readi() int {
	return int(readll())
}

// Reads next token and return it as float64
func readf() float64 {
	f, err := strconv.ParseFloat(reads(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

// Write args to OutputWriter with the format f
func printf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(OutputWriter, f, args...)
}

// Write args to OutputWriter without format
func println(args ...interface{}) (int, error) {
	return fmt.Fprintln(OutputWriter, args...)
}

// Write args to stderr with the format f
func eprintf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(os.Stderr, f, args...)
}

// Write args to stderr without format
func eprintln(args ...interface{}) (int, error) {
	return fmt.Fprintln(os.Stderr, args...)
}

// -----------------------------------------------------------------------------
// Simple math functions

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}
func min64(a, b int64) int64 {
	if a < b {
		return a
	}
	return b
}
func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}
func max64(a, b int64) int64 {
	if a < b {
		return b
	}
	return a
}
func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}
func abs64(a int64) int64 {
	if a < 0 {
		return -a
	}
	return a
}

// =============================================================================
func init() {
	// for non-interactive
	// SetInput(os.Stdin)
	// SetOutput(os.Stdout)

	// Enable below when interactive.  Its ok to leave above intact.
	SetInteractive(os.Stdout, os.Stdin)
}

func main() {
	defer Flush()

	N := readi()
	M := readi()

	PQ := NewPriorityQueue()
	for i := 0; i < N; i++ {
		PQ.Add(Pair{readi(), 0})
	}
	// PQ.Dump()
	var wk int
	for i := 0; i < M; i++ {
		pp := PQ.Poll()
		wk = pp.key / 2
		PQ.Add(Pair{wk, 0})
	}
	// PQ.Dump()
	var ans int64 = 0
	for !PQ.IsEmpty() {
		pp := PQ.Poll()
		ans += int64(pp.key)
	}
	println(ans)
	// PQ.Dump()
}

// Pair int int の構造体
type Pair struct {
	key int
	val int
}

// PriorityQueue プライオリティキュー
type PriorityQueue struct {
	tree []Pair
}

// NewPriorityQueue 初期化
func NewPriorityQueue() *PriorityQueue {
	return &PriorityQueue{[]Pair{}}
}

// isPrior 比較関数
func (q *PriorityQueue) isPrior(i, j int) bool {
	a, b := q.tree[i].key, q.tree[j].key
	return a > b || (a == b && q.tree[i].val > q.tree[j].val)
}

// IsEmpty 空か？
func (q *PriorityQueue) IsEmpty() bool {
	return len(q.tree) == 0
}

// swap 要素の入れ替え
func (q *PriorityQueue) swap(i, j int) {
	q.tree[i], q.tree[j] = q.tree[j], q.tree[i]
}

// Add 要素の追加
func (q *PriorityQueue) Add(v Pair) {
	index := len(q.tree)
	q.tree = append(q.tree, v)
	for index > 0 {
		parentIndex := ((index + 1) >> 1) - 1
		if q.isPrior(index, parentIndex) {
			q.swap(index, parentIndex)
			index = parentIndex
		} else {
			break
		}
	}
}

// Poll 値の取り出し（削除する）
func (q *PriorityQueue) Poll() Pair {
	result := q.tree[0]
	size := len(q.tree)
	q.tree[0] = q.tree[size-1]
	size--
	q.tree = q.tree[:size]
	for index := 0; ; {
		child := ((index + 1) << 1) - 1
		if child >= size {
			break
		}
		rIndex := child + 1
		if rIndex < size && q.isPrior(rIndex, child) {
			child = rIndex
		}
		if q.isPrior(index, child) {
			break
		}
		q.swap(index, child)
		index = child
	}
	return result
}

// Peek 値の読み出し（削除しない）
func (q *PriorityQueue) Peek() Pair {
	return q.tree[0]
}

// Dump ダンプ
func (q *PriorityQueue) Dump() {
	println("---------------------------")
	for i := 0; i < len(q.tree); i++ {
		printf("key = %d  val = %d\n", q.tree[i].key, q.tree[i].val)
	}
	println("---------------------------")
}

// =============================================================================


Measured memory_bytes: 12064