Give your algorithm designed to solve the following pseudo code and the problem of complexity: Let B = {b1, b2,, bn} and W = {w1, w2,, wn} is flat black spots and white spots on the two collection. A black dot bi = (xi, yi) with a white wj = (xj, yj) match if and only if xi ≥ xj and yi ≥ yj. Design a greedy algorithm to find the maximum match between black and white point number. Complexity of the algorithm to be as close as possible nlgn.

黑白匹配问题\Cpp1.cpp
............\测试数据.txt
黑白匹配问题

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．