Method compare

RangeSumOfSortedSubarraySums.java:6–8

(int a[], int b[])

    public int rangeSum(int[] nums, int n, int left, int right) {
        PriorityQueue<int[]> pq = new PriorityQueue<>(new Comparator<int[]>(){
            public int compare(int a[], int b[]){
                return a[0] - b[0];
            }
        });
        for(int i=0;i<n;i++){
            pq.offer(new int[]{nums[i],i});