import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution { static int[] minimumZooNumbers(int m, int n, char[] t, int[] s, int[] d) { PriorityQueue dropPoint = new PriorityQueue(new Comparator() { @Override public int compare(Animal o1, Animal o2) { return o1.drop-o2.drop; } }); List animals = new ArrayList(); for(int i=0;i() { @Override public int compare(Animal o1, Animal o2) { return o1.pickup-o2.pickup; } }); int[] animalDropCount = new int[d.length+1]; int currentZoo=0; int dropCount=0; Set onBoardAnimals = new HashSet(); dropPoint.add(new Animal('Z', Integer.MAX_VALUE, Integer.MAX_VALUE)); int i=0; while(!dropPoint.isEmpty()) { if(i