class Solution {
    public char slowestKey(int[] A, String s) {
        int pre=0;
        PriorityQueue<int[]>pq=new PriorityQueue<>((a,b)->{
            if(a[0]==b[0])return b[1]-a[1];
            return b[0]-a[0];
        });
        for(int i=0;i<A.length;i++){
            int t=A[i]-pre;
            pq.add(new int[]{t,s.charAt(i)});
            pre=A[i];
        }
        char c=(char)(pq.peek()[1]);
        return c;
    }
}