Codeforces-734B-Anton and Digits（贪心）

B. Anton and Digits
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Recently Anton found a box with digits in his room. There are k2 digits 2, k3 digits 3, k5 digits 5 and k6 digits 6.

Anton’s favorite integers are 32 and 256. He decided to compose this integers from digits he has. He wants to make the sum of these integers as large as possible. Help him solve this task!

Each digit can be used no more than once, i.e. the composed integers should contain no more than k2 digits 2, k3 digits 3 and so on. Of course, unused digits are not counted in the sum.

Input
The only line of the input contains four integers k2, k3, k5 and k6 — the number of digits 2, 3, 5 and 6 respectively (0 ≤ k2, k3, k5, k6 ≤ 5·106).

Output
Print one integer — maximum possible sum of Anton’s favorite integers that can be composed using digits from the box.

Examples
input
5 1 3 4
output
800
input
1 1 1 1
output
256
Note
In the first sample, there are five digits 2, one digit 3, three digits 5 and four digits 6. Anton can compose three integers 256 and one integer 32 to achieve the value 256 + 256 + 256 + 32 = 800. Note, that there is one unused integer 2 and one unused integer 6. They are not counted in the answer.

In the second sample, the optimal answer is to create on integer 256, thus the answer is 256.

题意：给出四个数字，代表可用的2,3,5,6的数量，求组合出256和32的最大和

贪心

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int main()
{
    int num_2,num_3,num_5,num_6;
    scanf("%d%d%d%d",&num_2,&num_3,&num_5,&num_6);
    int flag=min(num_2,min(num_5,num_6));
    long long int result=flag*256;
    num_2-=flag;
    num_5-=flag;
    num_6-=flag;
    flag=min(num_3,num_2);
    result+=flag*32;
    printf("%I64d\n",result);
    return 0;
}