1 条题解
-
0
C++ :
#include <bits/stdc++.h> using namespace std; int main(){ int a[1000],n,i,max = 0,s = 0; cin>>n; for(i = 0;i < n;i++){ cin>>a[i]; s = s + a[i]; if(a[i] >= max){ max = a[i]; } } cout<<fixed<<setprecision(1)<<(max * 0.9 + s - max) * 0.9<<endl; }Java :
import java.util.Scanner; public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] a = new int[n]; for(int i=0;i<n;i++){ a[i] = sc.nextInt(); } getMoney(a); } public static void getMoney(int[] a){ int t; for(int i=1;i<=a.length-1;i++){ for(int j=0;j<a.length-i;j++){ if(a[j]<a[j+1]){ t = a[j+1]; a[j+1] = a[j]; a[j] = t; } } } int sum = 0;double aver = 0;double f = 0 ; for(int i = 0;i<a.length;i++){ if(i !=0){ sum = sum + a[i]; } f = a[0]*0.9; } aver = (sum + f)*0.9; System.out.println(String.format("%.1f", aver)); } }Python :
n=int(input()) a=input().split() a=list(map(int,a)) da=max(a) s=(sum(a)-da+da*0.9)*0.9 print("%.1f"%s)
- 1
信息
- ID
- 407
- 时间
- 1000ms
- 内存
- 512MiB
- 难度
- 10
- 标签
- 递交数
- 1
- 已通过
- 1
- 上传者