Codeforces Round #379 (Div. 2）B

最新推荐文章于 2024-09-16 00:10:09 发布

Let力Go

最新推荐文章于 2024-09-16 00:10:09 发布

阅读量295

点赞数

分类专栏： codeforces

本文链接：https://blog.csdn.net/lwlldd/article/details/53463445

版权

codeforces 专栏收录该内容

7 篇文章 0 订阅

订阅专栏

                 B. Anton and Digits
          time limit per test1 second
         memory limit per test 256 megabytes
         http://codeforces.com/contest/734/problem/B

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.

题意：给出k2 个 2，k3 个3，k5个5，k6个6，用这些数字来组合成32或者256（一个数字用一次），并且要使得所有组合成的32,256 的和最大。

思路：要使得和最大，则要先获得最多的256，再去获得最多的32.
例如: 5个2, 1个3， 3个5, 4个6，
2,5,6这3个数字中，5数量最少，为3，则最大能获得3个256
剩余：2个2 ，1个3
3只有1个，因此，最多获得1个32
maxsum=3*256+32=800

代码：

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<map>
using namespace std;
int main(){
    int k2,k3,k5,k6;
    scanf("%d %d %d %d",&k2,&k3,&k5,&k6);
    int min=k2<k5?k2:k5;
    min=min<k6?min:k6;
    k2-=min;
    k5-=min;
    k6-=min;
    int min1=k2<k3?k2:k3;
    //int sum;
    long long sum=0;
    sum=min*256+min1*32;
    printf("%I64d\n",sum);


    return 0;
}