2024年C C++最新优先队列的使用方法+OJ案例讲解_c 优先队列例题，拿下offer全凭这套“面试+架构进阶知识点”pdf-CSDN博客

本文链接：https://blog.csdn.net/2401_84976491/article/details/138783485

既有适合小白学习的零基础资料，也有适合3年以上经验的小伙伴深入学习提升的进阶课程，涵盖了95%以上C C++开发知识点，真正体系化！

由于文件比较多，这里只是将部分目录截图出来，全套包含大厂面经、学习笔记、源码讲义、实战项目、大纲路线、讲解视频，并且后续会持续更新

Because of the wrong status of the bicycle, Sempr begin to walk east to west every morning and walk back every evening. Walking may cause a little tired, so Sempr always play some games this time.
There are many stones on the road, when he meet a stone, he will throw it ahead as far as possible if it is the odd stone he meet, or leave it where it was if it is the even stone. Now give you some informations about the stones on the road, you are to tell me the distance from the start point to the farthest stone after Sempr walk by. Please pay attention that if two or more stones stay at the same position, you will meet the larger one(the one with the smallest Di, as described in the Input) first.

Input

In the first line, there is an Integer T(1<=T<=10), which means the test cases in the input file. Then followed by T test cases.
For each test case, I will give you an Integer N(0<N<=100,000) in the first line, which means the number of stones on the road. Then followed by N lines and there are two integers Pi(0<=Pi<=100,000) and Di(0<=Di<=1,000) in the line, which means the position of the i-th stone and how far Sempr can throw it.

Output

Just output one line for one test case, as described in the Description.

Sample Input

Sample Output

11
12

题目大意为：

/*路上有很多石头，当你遇到奇数序列的石头就把他向前仍，偶数的不动，两个石头一起，先考虑扔的距离比较小的石头，这样一直下去，直到前面所有的石头都不可以扔了为止，求最远的石头距离起点多少！！
题目这题用优先队列非常方便
*/

比如说，在给出的案例中，第二个案例的12是这么来的：第一次我碰到了位置为1能扔5距离远的石头，我把它扔出去，这个石头就变成了位置为6能扔5距离的石头，

接下来我走到了位置为6的地方，有两个石头，根据题意，我先遇见能仍5距离的石头，再遇见能扔6距离的石头，所以第二次遇见的石头不管他，第三次遇见的石头将其扔出去位置从6变成了12，第四次又碰到这个石头不管他，然后之后的路程里就不会再有石头了。结果便输出12。

这个题用优先队列来求，非常的简单，直接套模板就能AC了

就代码来解释理解下所谓的优先队列

代码如下：

#include
#include
#include
#include
#include
#include
using namespace std ;
struct stone{//这是一种自定义设置优先队列优先级的方法，重载默认的 < 符号
int p;
int d;
friend bool operator< (stone a,stone b){
if(a.p==b.p)
return a.d>b.d;/注意这里的比较，这是写的数据越小优先级越高，即先取出数值小的元素其实也可以这么理解，队列我们是可以用数组来存储的，比较sort函数里我们写的cmp ，return a>b时是按降序来排列的，eg ：6 5 4 3 2 1，因为队列又是满足先进先出的原则，所以我们首先取出的是1，也就是数值最小的那个/
return a.p>b.p;
}
};
int main() {
int t;
scanf(“%d”,&t);
while(t–){
int n;
priority_queue st;
scanf(“%d”,&n);
stone t;
for(int i=0;i<n;i++){
scanf(“%d %d”,&t.p,&t.d);
st.push(t);
}
int cou=0;
stone tp;
while(!st.empty()){
tp=st.top();
st.pop();
if(++cou&1){
tp.p+=tp.d;
st.push(tp);
}
}
printf(“%d\n”,tp.p);