Maximum Sum Combination

import java.util.*;

class Solution {
    public ArrayList<Integer> topKSumPairs(int[] A, int[] B, int K) {
        int N = A.length;
        ArrayList<Integer> list = new ArrayList<>();
        Arrays.sort(A);
        Arrays.sort(B);
        PriorityQueue<Integer> pq = new PriorityQueue<>();

        for (int i = N - 1; i > N - 1 - K; i--) {
            for (int j = N - 1; j > N - 1 - K; j--) {
                int sum = A[i] + B[j];
                if (pq.size() < K)
                    pq.add(sum);
                else if (sum > pq.peek()) {
                    pq.poll();
                    pq.add(sum);
                } else
                    break;
            }
        }

        while (pq.size() > 0)
            list.add(0, pq.poll());

        return list;
    }
}