思维题

贪心
尽可能让256多
可以合成256的个数z=min(k2,k5,k6);
对于32同理 z=min(k3,k2);

#include<bits/stdc++.h>
using namespace std;
int k2,k3,k5,k6;
int main(){
    cin >> k2 >> k3 >> k5 >> k6;
    int z=0;
    int ans=0;
    z=min(k2,min(k5,k6));
    ans+=z*256;
    k2-=z;k5-=z;
    k6-=z;
    z=min(k2,k3);
    ans+=z*32;
    cout << ans << endl;
    return 0;
}