#include <stdio.h>
#include <stdlib.h>
//必要があれば,関数をいくつでも追加して良い
int solve(){
int ret;
//ここにプログラムを書く
//ret に答えを入れてメイン関数に返す
//入力を受ける部分も自分で書いてください
//今日の分を含め過去の授業のプログラムが
//参考になるはずです
int n,q,i;
int a[n];
for(i=0; i<n; i++){
}
int max = a[0];
for(int y=0; y<q; y++){
int maxIdx = 0;
for(int k=1; k<n; k++){
if(a[k] > a[maxIdx]) maxIdx = k;
}
a[maxIdx] = a[maxIdx] / 2; // 配列を直接更新
}
int sum=0;
for(int r=0; r<n; r++){
sum = sum+a[r];
}
ret =sum;
return ret;
}
//メイン関数はいじらなくて良い
int main(void){
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxzdGRsaWIuaD4KCi8v5b+F6KaB44GM44GC44KM44Gw77yM6Zai5pWw44KS44GE44GP44Gk44Gn44KC6L+95Yqg44GX44Gm6Imv44GECgppbnQgc29sdmUoKXsKICAgIGludCByZXQ7CiAgICAvL+OBk+OBk+OBq+ODl+ODreOCsOODqeODoOOCkuabuOOBjwogICAgLy9yZXQg44Gr562U44GI44KS5YWl44KM44Gm44Oh44Kk44Oz6Zai5pWw44Gr6L+U44GZCiAgICAvL+WFpeWKm+OCkuWPl+OBkeOCi+mDqOWIhuOCguiHquWIhuOBp+abuOOBhOOBpuOBj+OBoOOBleOBhAogICAgLy/ku4rml6Xjga7liIbjgpLlkKvjgoHpgY7ljrvjga7mjojmpa3jga7jg5fjg63jgrDjg6njg6DjgYwKICAgIC8v5Y+C6ICD44Gr44Gq44KL44Gv44Ga44Gn44GZCiAgICBpbnQgbixxLGk7CiAgICBzY2FuZigiJWQiICwmbik7CiAgICBzY2FuZigiJWQiICwmcSk7CiAgICBpbnQgYVtuXTsKICAgIGZvcihpPTA7IGk8bjsgaSsrKXsKICAgIAlzY2FuZigiJWQiICwmYVtpXSk7CiAgICAJICAgIH0KICAgIGludCBtYXggPSBhWzBdOwogICAgZm9yKGludCB5PTA7IHk8cTsgeSsrKXsKICAgIGludCBtYXhJZHggPSAwOwogICAgZm9yKGludCBrPTE7IGs8bjsgaysrKXsKICAgICAgICBpZihhW2tdID4gYVttYXhJZHhdKSBtYXhJZHggPSBrOwogICAgfQogICAgYVttYXhJZHhdID0gYVttYXhJZHhdIC8gMjsgIC8vIOmFjeWIl+OCkuebtOaOpeabtOaWsAp9CiAgICBpbnQgc3VtPTA7CiAgICBmb3IoaW50IHI9MDsgcjxuOyByKyspewogICAgCXN1bSA9IHN1bSthW3JdOwogICAgfQogICAgcmV0ID1zdW07CiAgICByZXR1cm4gcmV0Owp9CgovL+ODoeOCpOODs+mWouaVsOOBr+OBhOOBmOOCieOBquOBj+OBpuiJr+OBhAppbnQgbWFpbih2b2lkKXsKICAgIHByaW50ZigiJWRcbiIsc29sdmUoKSk7CiAgICByZXR1cm4gMDsKfQ==