2020-12-17 【 java优先队列的用法】

 java优先队列的用法

peek是top() 只取最上面的元素

poll是pop（） 弹出

add是添加 push

类的比较器，相对于仿函数

struct cmp{

bool operator ()(const node a,const node b){

}

}

 

Comparator<Node> comparator = new Comparator<Node>() {
    @Override
    public int compare(Node o1, Node o2) {
        return (o1.sum - o2.sum);
    }
};

PriorityQueue<Node> pq= new PriorityQueue<>(comparator);

import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.math.BigInteger;
import java.util.*;
import java.lang.Math.*;
public class Main {
    public static class Node {
        int i,j,sum;
    };
    public static int solve(int[] a,int[] b,int k){
        Comparator<Node> comparator = new Comparator<Node>() {
            @Ov