Files
OI-source/history_source/信息学奥赛一本通/2.6.7.cpp
2023-08-03 09:22:52 +08:00

20 lines
278 B
C++

#include<cstdio>
int main()
{
double max=0,sum=0,t;
int n,i;
while(scanf("%d",&n)==1)
{
max=sum=0;
for(i=0;i<n;i++)
{
scanf("%lf",&t);
sum+=t;
if(t>max) max=t;
}
if(sum-max<max) printf("%.1lf\n",sum-max);
else printf("%.1lf\n",sum/2.0);
}
return 0;
}