fork download 
  1. import java.util.*;
  2.  
  3. public class Main {
  4.     public static void main(String[] args) {
  5.         Scanner sc = new Scanner(System.in);
  6.         int n = sc.nextInt();
  7.         int[] arr = new int[n];
  8.         for (int i = 0; i < n; i++) {
  9.             arr[i] = sc.nextInt();
  10.         }
  11.  
  12.         // Convert to Integer array for descending sort
  13.         Integer[] integerArr = new Integer[n];
  14.         for (int i = 0; i < n; i++) {
  15.             integerArr[i] = arr[i];
  16.         }
  17.         Arrays.sort(integerArr, Collections.reverseOrder());
  18.  
  19.         long steps = 0;
  20.         int distinctCount = 0;
  21.  
  22.         for (int i = 1; i < n; i++) {
  23.             if (!integerArr[i].equals(integerArr[i-1])) {
  24.                 distinctCount = i;
  25.             }
  26.             steps += distinctCount;
  27.         }
  28.  
  29.         System.out.println(steps);
  30.     }
  31. }
Success #stdin #stdout 0.12s 56668KB
comments (?)
stdin 
3
5
2
1
stdout 
3
https://ideone.com/y4pbCk
language:
Java (HotSpot 12)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!