## 堆

| \# | 题名 | 题解 | 通过率 | 难度 | 出现频率   |
|------|----------------------|-----|--------|----|--------|
|882|[细分图中的可到达结点](https://leetcode-cn.com/problems/reachable-nodes-in-subdivided-graph)   |[7](https://leetcode-cn.com/problems/reachable-nodes-in-subdivided-graph/solution)|36.8%|困难|58.8%|
|864|[获取所有钥匙的最短路径](https://leetcode-cn.com/problems/shortest-path-to-get-all-keys)   |[14](https://leetcode-cn.com/problems/shortest-path-to-get-all-keys/solution)|38.8%|困难|45.59%|
|23|[合并K个排序链表](https://leetcode-cn.com/problems/merge-k-sorted-lists)   |[167](https://leetcode-cn.com/problems/merge-k-sorted-lists/solution)|48.2%|困难|42.33%|
|778|[水位上升的泳池中游泳](https://leetcode-cn.com/problems/swim-in-rising-water)   |[14](https://leetcode-cn.com/problems/swim-in-rising-water/solution)|45.3%|困难|41.54%|
|407|[接雨水 II](https://leetcode-cn.com/problems/trapping-rain-water-ii)   |[15](https://leetcode-cn.com/problems/trapping-rain-water-ii/solution)|32.9%|困难|37.06%|
|871|[最低加油次数](https://leetcode-cn.com/problems/minimum-number-of-refueling-stops)   |[11](https://leetcode-cn.com/problems/minimum-number-of-refueling-stops/solution)|28.8%|困难|36.89%|
|378|[有序矩阵中第K小的元素](https://leetcode-cn.com/problems/kth-smallest-element-in-a-sorted-matrix)   |[37](https://leetcode-cn.com/problems/kth-smallest-element-in-a-sorted-matrix/solution)|57.2%|中等|36.1%|
|215|[数组中的第K个最大元素](https://leetcode-cn.com/problems/kth-largest-element-in-an-array)   |[145](https://leetcode-cn.com/problems/kth-largest-element-in-an-array/solution)|59.9%|中等|34.49%|
|218|[天际线问题](https://leetcode-cn.com/problems/the-skyline-problem)   |[25](https://leetcode-cn.com/problems/the-skyline-problem/solution)|39.7%|困难|32.75%|
|743|[网络延迟时间](https://leetcode-cn.com/problems/network-delay-time)   |[24](https://leetcode-cn.com/problems/network-delay-time/solution)|44.7%|中等|27.01%|
|703|[数据流中的第K大元素](https://leetcode-cn.com/problems/kth-largest-element-in-a-stream)   |[48](https://leetcode-cn.com/problems/kth-largest-element-in-a-stream/solution)|41.3%|简单|24.9%|
|239|[滑动窗口最大值](https://leetcode-cn.com/problems/sliding-window-maximum)   |[80](https://leetcode-cn.com/problems/sliding-window-maximum/solution)|43.1%|困难|24.39%|
|502|[IPO](https://leetcode-cn.com/problems/ipo)   |[14](https://leetcode-cn.com/problems/ipo/solution)|35.6%|困难|24.16%|
|786|[第 K 个最小的素数分数](https://leetcode-cn.com/problems/k-th-smallest-prime-fraction)   |[7](https://leetcode-cn.com/problems/k-th-smallest-prime-fraction/solution)|33.9%|困难|23.36%|
|355|[设计推特](https://leetcode-cn.com/problems/design-twitter)   |[18](https://leetcode-cn.com/problems/design-twitter/solution)|36.6%|中等|22.64%|
|347|[前 K 个高频元素](https://leetcode-cn.com/problems/top-k-frequent-elements)   |[87](https://leetcode-cn.com/problems/top-k-frequent-elements/solution)|59.1%|中等|22.41%|
|253|[会议室 II](https://leetcode-cn.com/problems/meeting-rooms-ii)   |[27](https://leetcode-cn.com/problems/meeting-rooms-ii/solution)|38.9%|中等|20.84%|
|818|[赛车](https://leetcode-cn.com/problems/race-car)   |[10](https://leetcode-cn.com/problems/race-car/solution)|29.8%|困难|20.64%|
|295|[数据流的中位数](https://leetcode-cn.com/problems/find-median-from-data-stream)   |[38](https://leetcode-cn.com/problems/find-median-from-data-stream/solution)|40.7%|困难|18.77%|
|1046|[最后一块石头的重量](https://leetcode-cn.com/problems/last-stone-weight)   |[91](https://leetcode-cn.com/problems/last-stone-weight/solution)|58.6%|简单|15.9%|
|264|[丑数 II](https://leetcode-cn.com/problems/ugly-number-ii)   |[36](https://leetcode-cn.com/problems/ugly-number-ii/solution)|48.4%|中等|15.23%|
|451|[根据字符出现频率排序](https://leetcode-cn.com/problems/sort-characters-by-frequency)   |[53](https://leetcode-cn.com/problems/sort-characters-by-frequency/solution)|60.7%|中等|14.33%|
|767|[重构字符串](https://leetcode-cn.com/problems/reorganize-string)   |[17](https://leetcode-cn.com/problems/reorganize-string/solution)|38.0%|中等|12.09%|
|692|[前K个高频单词](https://leetcode-cn.com/problems/top-k-frequent-words)   |[23](https://leetcode-cn.com/problems/top-k-frequent-words/solution)|46.8%|中等|11.83%|
|787|[K 站中转内最便宜的航班](https://leetcode-cn.com/problems/cheapest-flights-within-k-stops)   |[15](https://leetcode-cn.com/problems/cheapest-flights-within-k-stops/solution)|34.0%|中等|9.64%|
|1054|[距离相等的条形码](https://leetcode-cn.com/problems/distant-barcodes)   |[22](https://leetcode-cn.com/problems/distant-barcodes/solution)|30.4%|中等|8.35%|
|313|[超级丑数](https://leetcode-cn.com/problems/super-ugly-number)   |[17](https://leetcode-cn.com/problems/super-ugly-number/solution)|59.1%|中等|6.36%|
|973|[最接近原点的 K 个点](https://leetcode-cn.com/problems/k-closest-points-to-origin)   |[31](https://leetcode-cn.com/problems/k-closest-points-to-origin/solution)|56.6%|中等|2.89%|
|857|[雇佣 K 名工人的最低成本](https://leetcode-cn.com/problems/minimum-cost-to-hire-k-workers)   |[6](https://leetcode-cn.com/problems/minimum-cost-to-hire-k-workers/solution)|37.3%|困难|&nbsp;|
|759|[员工空闲时间](https://leetcode-cn.com/problems/employee-free-time)   |[8](https://leetcode-cn.com/problems/employee-free-time/solution)|54.4%|困难|&nbsp;|
|719|[找出第 k 小的距离对](https://leetcode-cn.com/problems/find-k-th-smallest-pair-distance)   |[12](https://leetcode-cn.com/problems/find-k-th-smallest-pair-distance/solution)|30.5%|困难|&nbsp;|
|659|[分割数组为连续子序列](https://leetcode-cn.com/problems/split-array-into-consecutive-subsequences)   |[9](https://leetcode-cn.com/problems/split-array-into-consecutive-subsequences/solution)|40.1%|中等|&nbsp;|
|373|[查找和最小的K对数字](https://leetcode-cn.com/problems/find-k-pairs-with-smallest-sums)   |[19](https://leetcode-cn.com/problems/find-k-pairs-with-smallest-sums/solution)|39.6%|中等|&nbsp;|
|358|[K 距离间隔重排字符串](https://leetcode-cn.com/problems/rearrange-string-k-distance-apart)   |[6](https://leetcode-cn.com/problems/rearrange-string-k-distance-apart/solution)|35.1%|困难|&nbsp;|
