Description: Using a minimum heap to achieve an integer priority queue, the following functions are implemented: Insert x, adding elements of priority x to the team. Find x finds out the smallest element whose priority value is greater than x, and outputs its subscript. If there are multiple elements with the same priority value, the one with the lowest subscript is output. DECREASE I V reduces the priority value of the I node by v.
To Search:
File list (Check if you may need any files):
| Filename | Size | Date |
|---|
| 1216\1216.cbp | 1062 | 2018-11-01
|
| 1216\1216.layout | 360 | 2018-11-05
|
| 1216\bin\Debug\1216.exe | 1579039 | 2018-11-05
|
| 1216\main.cpp | 3120 | 2018-11-05
|
| 1216\obj\Debug\main.o | 18960 | 2018-11-05
|
| 1216\bin\Debug | 0 | 2018-11-05
|
| 1216\obj\Debug | 0 | 2018-11-05
|
| 1216\bin | 0 | 2018-11-05
|
| 1216\obj | 0 | 2018-11-05
|
| 1216 | 0 | 2018-11-05 |
Download