Method compare

MinimumCosttoConvertStringI.java:9–14

(long a[], long b[])

        dist[S] = 0;
        PriorityQueue<long[]> pq = new PriorityQueue<>(new Comparator<long[]>(){
            public int compare(long a[], long b[]){
                if(a[1]<=b[1]){
                    return -1;
                }
                return 1;
            }
        });
        pq.offer(new long[] {S,0});