codeforces 680A Bear and Five Cards

点击打开链接

A. Bear and Five Cards

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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?

Input

The only line of the input contains five integers t1, t2, t3, t4 and t5 (1 ≤ ti ≤ 100) — numbers written on cards.

Output

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

Examples

input

Copy

7 3 7 3 20

output

Copy

input

Copy

7 9 3 1 8

output

Copy

input

Copy

10 10 10 10 10

output

Copy

Note

In the first sample, Limak has cards with numbers 7, 3, 7, 3 and 20. Limak can do one of the following.

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

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

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 = 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 = 20.

水题

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
int main()
{  // freopen("shuju.txt","r",stdin);int a[10];memset(a,0,sizeof(a));int sum=0;for(int i=1;i<=5;i++){cin>>a[i];sum+=a[i];}sort(a+1,a+1+5);int mi=sum;for(int i=5;i>1;i--){if(a[i]==a[i-1]&&a[i]==a[i-2]){mi=min(mi,sum-a[i]*3);}if(a[i]==a[i-1]){mi=min(mi,sum-a[i]*2);}}  cout<<mi<<endl;return 0;
}

codeforces 680A Bear and Five Cards相关推荐

[ An Ac a Day ^_^ ] CodeForces 680A Bear and Five Cards
这两天回家了家里电脑太卡调试不方便就只能写写水题了-- 1 #include<stdio.h> 2 #include<iostream> 3 #include<al ...
CodeForces 658C Bear and Forgotten Tree 3（构造）
题意:构造一棵树,有N个点,直径为d,深度为h 思路:首先构造一个长度为d的链,然后把其中一个距离边上为h的点变为根.然后我们就不停的在距离根为h上面的那一点不停的加点就好了,使得新加入的点的距离也为 ...
Codeforces A - Bear and Prime 100（交互题）
A - Bear and Prime 100 思路:任何一个合数都可以写成2个以上质数的乘积.在2-100中,除了4,9,25,49外都可以写成两个以上不同质数的乘积. 所以打一个质数加这四个数的表: ...
Codeforces 658D Bear and Polynomials【数学】
题目链接: http://codeforces.com/contest/658/problem/D 题意: 给定合法多项式,改变一项的系数,使得P(2)=0,问有多少种方法? 分析: 暴力求和然后依次 ...
【CodeForces - 546C 】Soldier and Cards （模拟）
题干: Two bored soldiers are playing card war. Their card deck consists of exactly n cards, numbered f ...
Codeforces——791A Bear and Big Brother
小声BB 又开始更新了,最近打游戏王DL,这个栏目会留一些上分的心得. 题干 time limit per test:1 second memory limit per test:256 megaby ...
Codeforces A. Bear and Big Brother
...不行.这题之后.不做1000分以下的了.很耻辱 A. Bear and Big Brother time limit per test 1 second memory limit per tes ...
CodeForces 679B Bear and Tower of Cubes
$dfs$,贪心. #pragma comment(linker, "/STACK:1024000000,1024000000") #include<cstdio> # ...
codeforces 356C Bear and Square Grid
说是一个k的方块,里面的都可以变成点,问最大的联通块. 2A的原因是这个有意思的删点,联通块里的点不能有一个不在就直接删除,而是要标记一下,都出去了才能删除.机智. 大概思路就是,预处理每个联通快,完 ...

codeforces 680A Bear and Five Cards

codeforces 680A Bear and Five Cards相关推荐

最新文章

热门文章