✅Sum of smallest elements

Sum of smallest elements easy asked in interviews by 1 company Time Limit: 2 sec Memory Limit: 128000 kB

Problem Statement:

Given an array of N integers, find the 4 smallest number of the array and print their sum. Input First line contains n. next line contains n space separated integers.

Constraints 4 <= n <= 105 1 <= arr[i] <= 109 Output A single integer denoting the sum. Example Input: 6 3 1 6 9 4 1

Output: 9

Explanation : 3 + 1 + 4 + 1 = 9

link:https://my.newtonschool.co/playground/code/2b1pyiwg21rr/

```java
import java.io.*; // for handling input/output
import java.util.*; // contains Collections framework

// don't change the name of this class
// you can add inner classes if needed
class Main {
    public static void main (String[] args) {
    Scanner sc=new Scanner(System.in);
    int n=sc.nextInt();
    int arr[]=new int[n];
    for(int i=0;i<n;i++){
        arr[i]=sc.nextInt();
    }
    Arrays.sort(arr);
    long sum=0;
    for(int i=0;i<4;i++){
        sum +=arr[i];
    }
    System.out.println(sum);
    }
}
```