백준 : greedy - 로프 - 2217번(java)

import java.util.Arrays;
import java.util.Scanner;

public class Rope {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int[] ropes = new int[N];

        for (int i = 0; i < N; i++)
            ropes[i] = sc.nextInt();
        Arrays.sort(ropes);
        long max = 0;
        for (int i = N -1;i >= 0; i--){
            ropes[i] = ropes[i] * (N - i);
            if (max < ropes[i])
                max = ropes[i];
        }
        System.out.println(max);
    }
}