_1862.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.ArrayList;
importjava.util.List;
importjava.util.TreeMap;

publicclass_1862 {
publicstaticclassSolution1 {
/*
 * TODO: this results in TLE, fix it.
 */
publicintsumOfFlooredPairs(int[] nums) {
TreeMap<Integer, Integer> map = newTreeMap<>();
for (intnum : nums) {
map.put(num, map.getOrDefault(num, 0) + 1);
 }
List<Integer> list = newArrayList<>(map.keySet());
intmod = 1000000007;
longsum = 0L;
for (inti = list.size() - 1; i >= 0; i--) {
for (intj = i; j >= 0; j--) {
sum +=
 (list.get(i) / list.get(j))
 * map.get(list.get(j))
 * map.get(list.get(i));
sum %= mod;
 }
 }
return (int) sum;
 }
 }
}