{"id":236,"date":"2021-07-23T11:20:40","date_gmt":"2021-07-23T03:20:40","guid":{"rendered":"https:\/\/aisumura.net\/blog\/?p=236"},"modified":"2021-09-20T23:25:44","modified_gmt":"2021-09-20T15:25:44","slug":"priority-queue%e5%8d%87or%e9%99%8d%e5%86%aa%e6%8e%92%e5%ba%8f","status":"publish","type":"post","link":"https:\/\/aisumura.net\/blog\/2021\/07\/23\/priority-queue%e5%8d%87or%e9%99%8d%e5%86%aa%e6%8e%92%e5%ba%8f\/","title":{"rendered":"Priority queue\u5347or\u964d\u51aa\u6392\u5e8f"},"content":{"rendered":"\n<p style=\"font-size:22px\">\u672c\u4eba\u65bc\u8a72blog\u7684\u5168\u90e8\u6587\u7ae0\u8f49\u79fb\u81f3<a href=\"https:\/\/blog.kkwtech.com\/uva\/11536-smallest-sub-array\"><a href=\"https:\/\/blog.kkwtech.com\/algorithm\/priority-queue-descending-or-ascending-sort\">[Algorithm] Priority Queue Descending or Ascending Sort &#8211; KKWBlog (kkwtech.com)<\/a><\/a>\u8a72\u7db2\u57df\u4e0b\uff0c\u5176\u5f8c\u6b64\u8655\u4e0d\u9032\u884c\u66f4\u65b0\uff0c\u4e00\u5f8b\u65bc\u65b0\u7ad9\u9ede\u66f4\u65b0\u3002<\/p>\n\n\n\n<p>priority queue\u5e38\u7528\u65bc\u6709\u9700\u8981\u8cc7\u6599\u7684\u6392\u5e8f\u6642\u4f7f\u7528\uff0c\u6709\u5225\u65bcqueue\u662f\u4ee5array\u5be6\u4f5c\uff0cpriority queue\u5247\u662f\u4ee5heap\u4f86\u9054\u6210\u6392\u5e8f\u7684\u6548\u679c\uff0c\u65bcc++\u4e2d\u63d0\u4f9b\u4e86\u5df2\u7d93\u5b9a\u7fa9\u597d\u7684\u985e\u5225\u4f9b\u6211\u5011\u76f4\u63a5\u5ba3\u544a\u5c31\u80fd\u4f7f\u7528\uff0c\u57fa\u672c\u4e0a\u8ddfqueue\u7684\u7528\u6cd5\u5927\u540c\u5c0f\u7570\uff0c\u56e0\u6b64\u672c\u7bc7\u4e3b\u8981\u63d0\u51fa\u5982\u4f55\u8b93priority queue\u53ef\u4ee5\u505a\u5230\u751for\u964d\u51aa\u6392\u5e8f\u3002<\/p>\n\n\n\n<p>\u964d\u51aa\u6392\u5e8f:<br>\u9810\u8a2d\u7684priority queue\u5373\u70ba\u964d\u51aa\u6392\u5e8f\uff0c\u82e5\u6709\u9700\u8981\u4e5f\u53ef\u5beb\u6210<br><code>priority_queue&lt; int,&nbsp;vector&lt;int&gt;,&nbsp;less&lt;int&gt; &gt; pq;<\/code><\/p>\n\n\n\n<p>\u5347\u51aa\u6392\u5e8f:<br><code>priority_queue&lt; int,&nbsp;vector&lt;int&gt;,&nbsp;greater&lt;int&gt; &gt; pq;<\/code><\/p>\n\n\n\n<p>\u81ea\u5b9a\u7fa9\u8cc7\u6599\u7d50\u69cb\u6392\u5e8f:<br>\u9019\u90e8\u5206\u7121\u6cd5\u4f7f\u7528\u9810\u5148\u5b9a\u7fa9\u597d\u7684less or greater\u4f7f\u7528\uff0c\u9700\u8981\u81ea\u5df1\u5148\u5b9a\u7fa9compare\u624d\u80fd\u5b8c\u6210\u6bd4\u8f03\u3002<br>ex:\u5b9a\u7fa9\u4e00\u500bPair &lt;int,int&gt; p\uff0c\u6253\u7b97\u4ee5pair.second\u4ee5\u5347\u51aa\u6392\u5e8f<br>\u5099\u8a3b:\u95dc\u65bcstruct\u88e1\u7684operator()\u65bc\u4e0b\u4e00\u7bc7\u6587\u7ae0\u4e2d\u518d\u8a73\u7d30\u4ecb\u7d39<\/p>\n\n\n\n<pre class=\"wp-block-code\"><code lang=\"cpp\" class=\"language-cpp\">#include&nbsp;&lt;iostream&gt;\n#include&nbsp;&lt;queue&gt;\n#include&nbsp;&lt;vector&gt;\nusing&nbsp;namespace&nbsp;std;\n\ntypedef&nbsp;pair&lt;int,&nbsp;int&gt;&nbsp;p;\nstruct&nbsp;myComp&nbsp;{\n&nbsp;&nbsp;&nbsp;&nbsp;bool&nbsp;operator()(pair&lt;int,&nbsp;int&gt;&nbsp;a,pair&lt;int,&nbsp;int&gt;&nbsp;b)&nbsp;{\n&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;a.second&nbsp;&gt;&nbsp;b.second;\n&nbsp;&nbsp;&nbsp;&nbsp;}\n};\n\nint&nbsp;main()\n{\n&nbsp;&nbsp;&nbsp;&nbsp;priority_queue&lt;p,&nbsp;vector&lt;p&gt;,&nbsp;myComp&gt;&nbsp;p1;\n&nbsp;&nbsp;&nbsp;&nbsp;p1.push(make_pair(4,&nbsp;5));\n&nbsp;&nbsp;&nbsp;&nbsp;p1.push(make_pair(5,&nbsp;4));\n&nbsp;&nbsp;&nbsp;&nbsp;p1.push(make_pair(1,&nbsp;6));\n&nbsp;&nbsp;&nbsp;&nbsp;p1.push(make_pair(7,&nbsp;3));\n&nbsp;&nbsp;&nbsp;&nbsp;p1.push(make_pair(9,&nbsp;4));\n\n&nbsp;&nbsp;&nbsp;&nbsp;while&nbsp;(!p1.empty())&nbsp;{\n&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;p1.top().first\n&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&lt;&lt;&nbsp;\"&nbsp;\"&nbsp;&lt;&lt;&nbsp;p1.top().second\n&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&lt;&lt;&nbsp;endl;\n&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;p1.pop();\n&nbsp;&nbsp;&nbsp;&nbsp;}\n&nbsp;&nbsp;&nbsp;&nbsp;cout&nbsp;&lt;&lt;&nbsp;endl;\n&nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;0;\n}<\/code><\/pre>\n\n\n\n<figure class=\"wp-block-image size-large\"><img loading=\"lazy\" width=\"257\" height=\"111\" src=\"https:\/\/aisumura.net\/blog\/wp-content\/uploads\/2021\/07\/image-3.png\" alt=\"\" class=\"wp-image-240\"\/><\/figure>\n\n\n\n<p><\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u672c\u4eba\u65bc\u8a72blog\u7684\u5168\u90e8\u6587\u7ae0\u8f49\u79fb\u81f3[Algorithm] Priority Queue Descending o [&hellip;]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[13,18],"tags":[11,19],"_links":{"self":[{"href":"https:\/\/aisumura.net\/blog\/wp-json\/wp\/v2\/posts\/236"}],"collection":[{"href":"https:\/\/aisumura.net\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/aisumura.net\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/aisumura.net\/blog\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/aisumura.net\/blog\/wp-json\/wp\/v2\/comments?post=236"}],"version-history":[{"count":6,"href":"https:\/\/aisumura.net\/blog\/wp-json\/wp\/v2\/posts\/236\/revisions"}],"predecessor-version":[{"id":345,"href":"https:\/\/aisumura.net\/blog\/wp-json\/wp\/v2\/posts\/236\/revisions\/345"}],"wp:attachment":[{"href":"https:\/\/aisumura.net\/blog\/wp-json\/wp\/v2\/media?parent=236"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/aisumura.net\/blog\/wp-json\/wp\/v2\/categories?post=236"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/aisumura.net\/blog\/wp-json\/wp\/v2\/tags?post=236"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}