CF680A.Bear and Five Cards

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

A little bear Limak plays a game. He has five cards. There is one number written on each card. Each number is a positive integer.

Limak can discard (throw out) some cards. His goal is to minimize the sum of numbers written on remaining (not discarded) cards.

He is allowed to at most once discard two or three cards with the same number. Of course, he won't discard cards if it's impossible to choose two or three cards with the same number.

Given five numbers written on cards, cay you find the minimum sum of numbers on remaining cards?

输入格式

The only line of the input contains five integers t1t_{1} , t2t_{2} , t3t_{3} , t4t_{4} and t5t_{5} ( 1<=ti<=1001<=t_{i}<=100 ) — numbers written on cards.

输出格式

Print the minimum possible sum of numbers written on remaining cards.

输入输出样例

  • 输入#1

    7 3 7 3 20
    

    输出#1

    26
    
  • 输入#2

    7 9 3 1 8
    

    输出#2

    28
    
  • 输入#3

    10 10 10 10 10
    

    输出#3

    20
    

说明/提示

In the first sample, Limak has cards with numbers 77 , 33 , 77 , 33 and 2020 . Limak can do one of the following.

  • Do nothing and the sum would be 7+3+7+3+20=407+3+7+3+20=40 .
  • Remove two cards with a number 77 . The remaining sum would be 3+3+20=263+3+20=26 .
  • Remove two cards with a number 33 . The remaining sum would be 7+7+20=347+7+20=34 .

You are asked to minimize the sum so the answer is 2626 .

In the second sample, it's impossible to find two or three cards with the same number. Hence, Limak does nothing and the sum is 7+9+1+3+8=287+9+1+3+8=28 .

In the third sample, all cards have the same number. It's optimal to discard any three cards. The sum of two remaining numbers is 10+10=2010+10=20 .

首页