1 条题解

  • 0
    @ 2023-6-11 12:21:10

    C++ :

    #include<bits/stdc++.h>
    using namespace std;
    
    
    int main() {
    	int n,a[110],s = 0,ma = INT_MIN;
    	cin>>n;
    	int i;
    	for(i = 0; i < n; i++) {
    		cin>>a[i];
    		s += a[i];
    		ma = max(ma,a[i]);
    	}
    	
    	if(s > 100){
    		cout<<"Yes"<<endl;
    		s = s - ma;
    	}else{
    		cout<<"No"<<endl;
    	}
    	cout<<s;
    }
    
    

    Java :

    import java.util.Scanner;
    public class Main {
        public static void main(String[] args) {
            Scanner scanner = new Scanner(System.in);
            int num1 = scanner.nextInt();
    //        int num2 = scanner.nextInt();
            int[] a = new int[num1];
            int x = 0,y = 0,s = 0;
            for (int i = 0; i < num1; i++) {
                a[i] = scanner.nextInt();
                s = s + a[i];
            }
            if(s > 100){
                System.out.println("Yes");
                System.out.println(s - MAX(a));
            }else {
                System.out.println("No");
                System.out.println(s);
            }
        }
    
        public static boolean judge(int i,int j){
            int a,s = 0;
            while(i != 0){
                a = i % 10;
                s = s + a;
                i /= 10;
            }
            if(s == j)return true;
            else return false;
        }
    
        public static void paiXu(int[] a){
            int temp;
            for(int i = 0;i < a.length - 1;i++){
                for(int k = 0;k < a.length - i - 1;k++){
                    if(a[k] > a[k + 1]){
                        temp = a[k];
                        a[k] = a[k + 1];
                        a[k + 1] = temp;
                    }
                }
            }
        }
    
        public static int MAX(int[] a){
            int max = a[0];
            for (int i = 0; i < a.length; i++) {
                if(max < a[i]){
                    max = a[i];
                }
            }
            return max;
        }
    
        public static int MIN(int[] a){
            int min = a[0];
            for (int i = 0; i < a.length; i++) {
                if(min > a[i]){
                   min = a[i];
                }
            }
            return min;
        }
    }
    

    Python :

    n = int(input())
    m = input().split()
    su = 0
    for i in range(0, n):
        m[i] = int(m[i])
        su += m[i]
    mx = max(m)
    if su > 100:
        print('Yes')
        print(su - mx)
    else:
        print('No')
        print(su)
    
    
    • 1

    信息

    ID
    2676
    时间
    1000ms
    内存
    16MiB
    难度
    (无)
    标签
    递交数
    0
    已通过
    0
    上传者