https://blog.youkuaiyun.com/m0_73823403zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/m0_73823403/article/details/133543459https://blog.youkuaiyun.com/m0_73823403/article/details/133543459m0_73823403Fri, 06 Oct 2023 12:45:43 +0800https://blog.youkuaiyun.com/m0_73823403/article/details/133519220https://blog.youkuaiyun.com/m0_73823403/article/details/133519220m0_73823403Tue, 03 Oct 2023 16:48:07 +0800https://blog.youkuaiyun.com/m0_73823403/article/details/133514192https://blog.youkuaiyun.com/m0_73823403/article/details/133514192m0_73823403Tue, 03 Oct 2023 12:10:49 +0800https://blog.youkuaiyun.com/m0_73823403/article/details/133500673https://blog.youkuaiyun.com/m0_73823403/article/details/133500673m0_73823403Tue, 03 Oct 2023 11:16:20 +0800https://blog.youkuaiyun.com/m0_73823403/article/details/132270418https://blog.youkuaiyun.com/m0_73823403/article/details/132270418m0_73823403Mon, 14 Aug 2023 10:46:56 +0800https://blog.youkuaiyun.com/m0_73823403/article/details/132269367https://blog.youkuaiyun.com/m0_73823403/article/details/132269367m0_73823403Mon, 14 Aug 2023 09:45:26 +0800是 最小值的优先队列，top() 是当前优先队列的最小值。priority_queue ：是默认的大根堆实现，top()是当前优先队列的最大值。或deque），第三个为一个比较的规则，决定是最大优先队列还是最小优先队列，默认的。为最小优先队列，实现方式是最小堆，结构都是二叉树。为最大优先队列，实现方式是最大堆，]]>https://blog.youkuaiyun.com/m0_73823403/article/details/132268756https://blog.youkuaiyun.com/m0_73823403/article/details/132268756m0_73823403Mon, 14 Aug 2023 09:23:20 +0800举列子：while(scanf("%d",&n)==1);a和b都被成功读入，那么scanf的返回值就是2。只有a被成功读入，返回值为1。表达式1:表达式2。a读取失败，返回值为0。]]>https://blog.youkuaiyun.com/m0_73823403/article/details/132256407https://blog.youkuaiyun.com/m0_73823403/article/details/132256407m0_73823403Sun, 13 Aug 2023 08:39:03 +0800https://blog.youkuaiyun.com/m0_73823403/article/details/132180530https://blog.youkuaiyun.com/m0_73823403/article/details/132180530m0_73823403Wed, 09 Aug 2023 09:13:36 +0800https://blog.youkuaiyun.com/m0_73823403/article/details/132037183https://blog.youkuaiyun.com/m0_73823403/article/details/132037183m0_73823403Tue, 01 Aug 2023 10:41:26 +0800https://blog.youkuaiyun.com/m0_73823403/article/details/132006840https://blog.youkuaiyun.com/m0_73823403/article/details/132006840m0_73823403Sun, 30 Jul 2023 14:35:16 +0800https://blog.youkuaiyun.com/m0_73823403/article/details/132006134https://blog.youkuaiyun.com/m0_73823403/article/details/132006134m0_73823403Sun, 30 Jul 2023 13:17:30 +0800