Sort by

recency

|

6107 Discussions

|

  • + 0 comments
     long valMx = 0, valMn = 0;
    
            arr.sort((a,b)->(a.compareTo(b)));
    
            for(int i = 0;  i < arr.size()-1; i ++  ){
    
            valMn += arr.get(i);
            valMx +=arr.get(i+1);                      
    
            } 
            System.out.print(valMn+" "+valMx);
    
    }
    
  • + 0 comments
            List<Int64> minMax = new List<Int64>();
            for(int i=0; i < arr.Count(); i++)
            {
                var xx = arr.Select(x => Convert.ToInt64(x)).ToList();
                xx.Remove(arr[i]);
                minMax.Add(xx.Sum());
            }
    
            Console.WriteLine(minMax.Min() + " " + minMax.Max());
    
  • + 0 comments

    // C++ void miniMaxSum(vector arr) { long minNum = arr[0]; long bigNum = arr[0];

    long long sum = 0;
    
    for (int i = 0; i < arr.size(); i++) {
        sum += arr[i];
    
        if (arr[i] < minNum) {
            minNum = arr[i];
        }
    
        if (arr[i] > bigNum) {
            bigNum = arr[i];
        }
    }
    
    cout << sum - bigNum << " " << sum - minNum;
    

    }

  • + 0 comments
    // C#
    public static void miniMaxSum(List<int> arr)
        {
            for (int i = 0; i <= arr.Count - 2; i++)
            {
                if (arr[i] > arr[i + 1])
                {
                    int temp = arr[i];
                    arr[i] = arr[i+1];
                    arr[i+1] = temp;
                }
                
                int pos = (arr.Count - 1) - i;
                if (arr[pos] < arr[pos - 1])
                {
                    int temp = arr[pos];
                    arr[pos] = arr[pos - 1];
                    arr[pos - 1] = temp;
                }
            }
            
            long min = 0;
            long max = 0;
            for (int i = 0; i < arr.Count; i++)
            {
                if (i > 0)
                    max += arr[i];
                
                if (i < arr.Count - 1)
                    min += arr[i];
            }
            
            Console.WriteLine($"{min} {max}");
        }
    
    }
    
  • + 0 comments

    import java.io.; import java.util.;

    class Result {

    /*
     * Complete the 'miniMaxSum' function below.
     * The function accepts INTEGER_ARRAY arr as parameter.
     */
    
    public static void miniMaxSum(List<Integer> arr) {
        long totalSum = 0;
        long min = Long.MAX_VALUE;
        long max = Long.MIN_VALUE;
    
        for (int num : arr) {
            totalSum += num;
            if (num < min) min = num;
            if (num > max) max = num;
        }
    
        long minSum = totalSum - max; // exclude largest
        long maxSum = totalSum - min; // exclude smallest
    
        System.out.println(minSum + " " + maxSum);
    }
    

    }

    public class Solution { public static void main(String[] args) throws IOException { BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));

        String[] input = bufferedReader.readLine().trim().split(" ");
        List<Integer> arr = new ArrayList<>();
    
        for (int i = 0; i < 5; i++) {
            arr.add(Integer.parseInt(input[i]));
        }
    
        Result.miniMaxSum(arr);
    
        bufferedReader.close();
    }
    

    }