Building a capacity of large root heap k sequentially read int data elements if a large root heap is full, then compare whether the read element is less than the maximum stack top, is the largest element first deleted, and then pressed into a new element. If large root heap element is not full, direct read Pressed into large root heap. In the n elements in order to determine the comparison process after completion, to obtain n data smallest k data. Which in turn is popped the top of the heap, is about the smallest k elements in descending output.

Min
...\Debug
...\.....\Min.exe
...\.....\Min.ilk
...\.....\Min.pdb
...\Min
...\Min.sdf
...\Min.sln
...\Min.v11.suo
...\...\Debug
...\...\.....\CL.read.1.tlog
...\...\.....\CL.write.1.tlog
...\...\.....\link-cvtres.read.1.tlog
...\...\.....\link-cvtres.write.1.tlog
...\...\.....\link-rc.read.1.tlog
...\...\.....\link-rc.write.1.tlog
...\...\.....\link.read.1.tlog
...\...\.....\link.write.1.tlog
...\...\.....\Min.lastbuildstate
...\...\.....\Min.log
...\...\.....\Min.obj
...\...\.....\vc110.idb
...\...\.....\vc110.pdb
...\...\Min.cpp
...\...\Min.vcxproj
...\...\Min.vcxproj.filters
...\reportof4-3.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．