当前位置：网站首页>nyoj754 黑心医生结构体优先队列

nyoj754 黑心医生结构体优先队列

2022-08-05 10:25:00 【51CTO】

       
       对队列不懂的  
       
       可以看看我转的这篇文章
       
       <
       
       a 
       
       target
       
       =
       
       _blank 
       
       href
       
       =
       
       target
       
       =
       
       "_blank"
       
       >
       
       点击打开链接
       
       </
       
       a
       
       >
      
1.

       
       #include <stdio.h>
       
       #include <queue>
       
       using 
       
       namespace 
       
       std;
       
       typedef 
       
       struct
       
{
       
       int 
       
       rich,
       
       num;
       
}
       
       node;
       
       queue
       
       <
       
       node
       
       > 
       
       s1;
       
       priority_queue
       
       <
       
       int,
       
       vector
       
       <
       
       int
       
       >,
       
       less
       
       <
       
       int
       
       > 
       
       >
       
       s2;
       
       //把less换成greater就是从小到大
       
       int 
       
       main()
       
{
       
       node 
       
       t,
       
       v;
       
       int 
       
       n,
       
       m,
       
       x;
       
       while(
       
       scanf(
       
       "%d %d",
       
       &
       
       n,
       
       &
       
       m)
       
       !=
       
       EOF)
       
  {
       
       while(
       
       !
       
       s1.
       
       empty())
       
       //必须清队列
       
       s1.
       
       pop();
       
       while(
       
       !
       
       s2.
       
       empty())
       
       //同上
       
       s2.
       
       pop();
       
       for(
       
       int 
       
       i
       
       =
       
       0;
       
       i
       
       <
       
       n;
       
       i
       
       ++)
       
    {
       
       scanf(
       
       "%d",
       
       &
       
       x);
       
       t.
       
       rich
       
       =
       
       x;
       
       t.
       
       num
       
       =
       
       i;
       
       s1.
       
       push(
       
       t);
       
       s2.
       
       push(
       
       x);
       
    }
       
       for(
       
       int 
       
       i
       
       =
       
       0;
       
       i
       
       <
       
       n;
       
       i
       
       ++)
       
    {
       
       v
       
       =
       
       s1.
       
       front();
       
       if(
       
       v.
       
       rich
       
       ==
       
       s2.
       
       top())
       
       s2.
       
       pop();
       
       else
       
      {
       
       while(
       
       v.
       
       rich
       
       !=
       
       s2.
       
       top())
       
       s1.
       
       push(
       
       v),
       
       s1.
       
       pop(),
       
       v
       
       =
       
       s1.
       
       front();
       
       s2.
       
       pop();
       
      }
       
       if(
       
       v.
       
       num
       
       ==
       
       m)
       
      {
       
       s1.
       
       pop();
       
       break;
       
      }
       
       else
       
       s1.
       
       pop();
       
    }
       
       printf(
       
       "%d\n",
       
       n
       
       -
       
       s2.
       
       size());
       
  }
       
       return 
       
       0;
       
}
      
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26.
27.
28.
29.
30.
31.
32.
33.
34.
35.
36.
37.
38.
39.
40.
41.
42.
43.
44.
45.
46.
47.
48.
49.
50.