Submission #351198

---

Source Code Expand

import java.util.*;

public class Main {

	
	public static void main(String[] arg){
		
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] t = new int[n];
		ArrayList<Integer> ar = new ArrayList<Integer>();
		HashMap<Integer,Integer> hm = new HashMap<Integer,Integer>();
		for(int i = 0;i < n;i++){
			t[i] = sc.nextInt();
			ar.add(t[i]);
			hm.put(t[i], 0);
		}
		for(int i = 0;i < n;i++){
			int num = hm.get(t[i]);
			hm.put(t[i], num+1);
		}
		int[] syurui = new int[hm.size()];
		int[] time = new int[hm.size()];
		int i2 = 0;
		int j2 = 0;
			Collections.sort(ar);
		while(hm.size() > 0){
			if(hm.containsKey(ar.get(i2))){
				syurui[j2] = hm.get(ar.get(i2));
				time[j2++] = ar.get(i2);
				hm.remove(ar.get(i2));
			}
			i2++;
		}
//		for(int i = 0;i < ar.size();i++){
//			System.out.println(i + "   " + ar.get(i));
//		}
//		for(int i = 0;i < syurui.length;i++){
//			System.out.println(syurui[i]);
//		}
		long mes = 0;
		long pen = 0;
		for(int i = 0;i < ar.size();i++){
			mes += ar.get(i);
			pen += mes;
		}
		long mod = 1000000000+7;
		long ans = 1;
		for(int i  = 0;i < syurui.length;i++){
			for(int j = 2;j <= syurui[i];j++){
				ans = (ans * j)%mod;
			}
		}
		System.out.println(pen);
		System.out.println(ans);
				
	
		
		
				
	}

	static int find(int[]par,int x){
		if(par[x] == x)return par[x];
		else {
			return par[x] = find(par,par[x]);
		}
	}
	static void unite(int[] par,int[] rank,int x,int y){
		if(find(par,x) == find(par,y))return;
		else{
			if(rank[x] < rank[y]){
				par[x] = find(par,y);
			} else {
				par[y] = find(par,x);
				if(rank[x] == rank[y])rank[x]++;
			}
		}
	}
	
}

Submission Info

Judge Result