Optimized with a greedy heap, from the meaning of the questions, we can get the most violent solution is that every day, search the entire array, to find qualified experience in the subject and it is the biggest, so look for M-day fine. The next step is how to optimize in each time looking for the experience as long as we find the greatest, because the big top of the heap can be the subject of the organization can do, each time after the upgrade can be done by adding a new subject was OK.

3230.cpp

• 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．