Codeforces 639A Bear and Displayed Friends (优先队列)
2016-12-25 20:53
645 查看
题目链接:点击打开链接
#include<stdio.h>
#include<queue>
using namespace std;
struct node{
int id,val;
}num[150010];
int visit[150010];
bool operator<(const node &a,const node &b)
{
return a.val>b.val;
}
int main()
{
int n,k,m,i,op,x;
node now;
while(~scanf("%d%d%d",&n,&k,&m))
{
for(i=1;i<=n;i++)
{
scanf("%d",&num[i].val);
num[i].id=i;
visit[i]=0;
}
priority_queue<node>q;
while(m--)
{
scanf("%d%d",&op,&x);
if(op==1)
{
q.push(num[x]);
visit[x]=1;
if(q.size()>k)
{
visit[q.top().id]=0;
q.pop();
}
}
else
if(visit[x]==1)
printf("YES\n");
else
printf("NO\n");
}
}
return 0;
}
#include<stdio.h>
#include<queue>
using namespace std;
struct node{
int id,val;
}num[150010];
int visit[150010];
bool operator<(const node &a,const node &b)
{
return a.val>b.val;
}
int main()
{
int n,k,m,i,op,x;
node now;
while(~scanf("%d%d%d",&n,&k,&m))
{
for(i=1;i<=n;i++)
{
scanf("%d",&num[i].val);
num[i].id=i;
visit[i]=0;
}
priority_queue<node>q;
while(m--)
{
scanf("%d%d",&op,&x);
if(op==1)
{
q.push(num[x]);
visit[x]=1;
if(q.size()>k)
{
visit[q.top().id]=0;
q.pop();
}
}
else
if(visit[x]==1)
printf("YES\n");
else
printf("NO\n");
}
}
return 0;
}
相关文章推荐
- codeforces 658B B. Bear and Displayed Friends(优先队列)
- 【Codeforces 639A】Bear and Displayed Friends
- Codeforces 639A Bear and Displayed Friends 【STL】
- CodeForces 639 A.Bear and Displayed Friends(水~)
- Codeforces 658B Bear and Displayed Friends【set】
- Codeforces 658B Bear and Displayed Friends【set】
- codeforces 658B-Bear and Displayed Friends
- VK Cup 2016 - Round 1 (Div. 2 Edition) B B. Bear and Displayed Friends 优先队列
- CodeForces 658B Bear and Displayed Friends(树状数组)
- 【VK Cup 2016 - Round 1 (Div 2 Edition)B】【水题】Bear and Displayed Friends 即时维护最大6个数
- VK Cup 2016 - Round 1 (Div. 2 Edition)-B - Bear and Displayed Friends-STL(维护前k大)
- VK Cup 2016 - Round 1 (Div. 2 Edition) B. Bear and Displayed Friends 树状数组
- A. Bear and Displayed Friends
- 【codeforces 483B】Friends and Presents
- Codeforces 660F:Bear and Bowling 4
- CodeForces 660F Bear and Bowling 4(斜率DP+二分)
- 【CODEFORCES】 B. Friends and Presents
- codeforces 405 D. Bear and Tree Jumps 树形dp
- Codeforces 385 D Bear and Floodlight
- codeforces 673D D. Bear and Two Paths(构造)