贪心算法解决收益问题

import java.util.Comparator;
import java.util.PriorityQueue;
public class IPO {
  public static class Node {
    public int p, c;

    Node(int p, int c) {
      this.p = p;
      this.c = c;
    }
  }

  public static class MinComparator implements Comparator<Node> {
    public int compare(Node n1, Node n2) { return n1.c - n2.c; }
  }

  public static class MaxComparator implements Comparator<Node> {
    public int compare(Node n1, Node n2) { return n2.p - n1.p; }
  }

  public static int findMax(int k, int W, int[] Profits, int[] Capital) {
    Node[] nodes = new Node[Profits.length];
    for (int i = 0; i < Profits.length; i++) {
      nodes[i] = new Node(Profits[i], Capital[i]); //存储投资与收益信息
    }
    PriorityQueue<Node> minCostQ = new PriorityQueue<>(new MinComparator());
    PriorityQueue<Node> maxProfitQ = new PriorityQueue<>(new MaxComparator());
    for (int i = 0; i < nodes.length; i++) {
      minCostQ.add(nodes[i]);
    }
    for (int i = 0; i < k; i++) {
      while (!minCostQ.isEmpty() && minCostQ.peek().c <= W) {
        maxProfitQ.add(minCostQ.poll());
      }
      if (maxProfitQ.isEmpty()) {
        return W;
      }
      W += maxProfitQ.poll().p;
    }
    return W;
  }
}