题目链接:
//#include <bits/stdc++.h> #include <vector> #include <iostream> #include <queue> #include <cmath> #include <map> #include <cstring> #include <algorithm> #include <cstdio> using namespace std; #define Riep(n) for(int i=1;i<=n;i++) #define Riop(n) for(int i=0;i<n;i++) #define Rjep(n) for(int j=1;j<=n;j++) #define Rjop(n) for(int j=0;j<n;j++) #define mst(ss,b) memset(ss,b,sizeof(ss)); typedef long long LL; template<class T> void read(T&num) { char CH; bool F=false; for(CH=getchar();CH<‘0‘||CH>‘9‘;F= CH==‘-‘,CH=getchar()); for(num=0;CH>=‘0‘&&CH<=‘9‘;num=num*10+CH-‘0‘,CH=getchar()); F && (num=-num); } int stk[70], tp; template<class T> inline void print(T p) { if(!p) { puts("0"); return; } while(p) stk[++ tp] = p%10, p/=10; while(tp) putchar(stk[tp--] + ‘0‘); putchar(‘\n‘); } const LL mod=1e9+7; const double PI=acos(-1.0); const LL inf=1e14; const int N=1e5+15; int a[10],flag[200]; int main() { int sum=0; for(int i=1;i<=5;i++)read(a[i]),sum+=a[i],flag[a[i]]++; int ans=sum; for(int i=1;i<=5;i++) { if(flag[a[i]]>1&&flag[a[i]]<4) ans=min(ans,sum-flag[a[i]]*a[i]); else if(flag[a[i]]>3) { ans=min(ans,sum-3*a[i]); } } cout<<ans<<"\n"; return 0; }
时间: 2024-10-11 21:51:56