Pagini recente » Cod sursa (job #2317210) | Cod sursa (job #884687) | Cod sursa (job #3265784) | Cod sursa (job #897945) | Cod sursa (job #1722334)
#include <fstream>
#include <math.h>
#include <vector>
#include <set>
#include <algorithm>
#include <cstring>
//#include <unordered_map>
#include <iomanip>
#include <time.h>
#include <stdio.h>
#include <bitset>
#include <map>
#define MAX 500000000000
//#include <iostream>
#include <windows.h>
#include <deque>
using namespace std;
ifstream cin("jocul.in");
ofstream cout("jocul.out");
//ifstream cin("graf.in");
//ofstream cout("graf.out");
int x[408];
int main()
{
int mil = 100000, s = 0;
for(int i = 0; i < 5; i++)
{
int a;
cin >> a;
x[a]++;
s += a;
}
mil = s;
for(int i = 101; i >= 0; i--)
if(x[i] >= 3)
{
mil = min(s - i * 3, mil);
}
else
if(x[i] == 2)
{
mil = min(s - i * 2, mil);
}
cout << mil;
}