zoukankan      html  css  js  c++  java
  • C

    Description

    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 t1t2t3t4 and t5 (1 ≤ ti ≤ 100) — numbers written on cards.

    Output

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

    Sample Input

    Input
    7 3 7 3 20
    Output
    26
    Input
    7 9 3 1 8
    Output
    28
    Input
    10 10 10 10 10
    Output
    20

    题意:共有5张卡,可将两张或三张重复卡片扔掉,求扔掉后和的最小值。

    排序后找到最大重复卡片和减掉即可。

    附AC代码:

     1 #include<iostream>
     2 #include<cstdio>
     3 #include<cstring>
     4 #include<algorithm>
     5 #include<cmath>
     6 using namespace std;
     7 
     8 int a[6];
     9 int main(){
    10     for(int i=0;i<5;i++){
    11         cin>>a[i];
    12     }
    13     sort(a,a+5);
    14     int ans=2,Max=0,sum=0;
    15     for(int i=0;i<5;i++){
    16         if(a[i]==a[i+1]){
    17             if(ans<=3)//最多扔三张 
    18             Max=max(Max,a[i]*ans);
    19             ans++;
    20         }
    21         else
    22         ans=2;
    23     }
    24     for(int i=0;i<5;i++){
    25         sum+=a[i];
    26     }
    27     cout<<sum-Max<<endl;
    28     return 0;
    29 }
  • 相关阅读:
    接口测试基础
    python学习笔记(一)
    Charles学习笔记
    接口测试笔记
    【CSS】Beginner5:Margins&Padding
    【CSS】Beginner4:Text
    【CSS】Beginner3:Color
    【CSS】Beginner2:Selectors, Properties, and Values
    【CSS】Beginner1:Applying CSS
    【HTML】Beginner9:Form
  • 原文地址:https://www.cnblogs.com/Kiven5197/p/5659197.html
Copyright © 2011-2022 走看看