Submission #73093920

---

Source Code Expand

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner k = new Scanner(System.in);
        int N = k.nextInt();
        String []val = new String[N];
        Map<Integer,Long> map = new HashMap<>();
        int max = 0;
        for(int i=0;i<N;i++){
            int n = k.nextInt();
            max = Math.max(max,n);
            map.put(n,map.getOrDefault(n,0L)+1);
        }
        long []dig = new long[max+1];
        for(int i = max;i>=1;i--){
            if(map.containsKey(i))dig[i] = map.get(i);
            if(i<max){
                dig[i]+=dig[i+1];
            }
        }
        StringBuilder sb = new StringBuilder();
        long carry = 0;
        for(int i=1;i<=max;i++){
            sb.append((dig[i]+carry)%10);
            carry = (dig[i]+carry)/10;
        }
        while(carry>0){
            sb.append(carry%10);
            carry/=10;
        }
        System.out.print(sb.reverse());
    }
}

Submission Info

Judge Result