import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { static long maximumPeople(long[] p, long[] x, long[] y, long[] r) { // Return the maximum number of people that will be in a sunny town after removing exactly one cloud. HashMap hm=new HashMap(); for(int i=0;i=(long)m.getKey()&& x[i]<=(long)m.getValue()) { count++; break; } } if(count==0) popu+=p[i]; } long max=0; for(Map.Entry m:hm.entrySet()){ long pop=0; for(int i=0;i=(long)m.getKey()&& x[i]<=(long)m.getValue()) { pop+=p[i]; } } if(max