BZOJ 1528--sam-Toy Cars(堆&贪心)

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<queue>
#include<vector>
#define inf 1000000
using namespace std;
int n,k,p;
int toy[600000],tim[110000],nxt[600000];
bool c[110000];
priority_queue< pair<int,int> ,vector< pair<int,int> > >q;
int main(){
    int ans=0;
    scanf("%d%d%d",&n,&k,&p);
    for(int i=1;i<=p;i++){
        scanf("%d",&toy[i]);
        nxt[tim[toy[i]]]=i;
        tim[toy[i]]=i;
        nxt[i]=inf;
    }
    int js=0;
    for(int i=1;i<=p;i++){
        if(c[toy[i]]==1){
            q.push(make_pair(nxt[i],toy[i]));
            continue;
        }
        if(js==k){
            while(c[q.top().second]==0) q.pop(); 
            c[q.top().second]=0;
            q.pop();
            js--;
        }
        js++;
        ans++;
        c[toy[i]]=1;
        q.push(make_pair(nxt[i],toy[i]));
    }
    printf("%d\n",ans);
    return 0;
}