选择客栈

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=2e5+7;
const int maxc=57;
int n,k,p,ret=0;
int col[maxn],f[maxn],cst[maxn],minn[maxc],before[maxc],sum[maxc],ans[maxc];
int main(){
    memset(minn,2147483647,sizeof(minn));
    cin>>n>>k>>p;
    for(int i=1;i<=n;i++) cin>>col[i]>>cst[i];
    for(int i=1;i<=n;i++){
        for(int j=0;j<k;j++)
            minn[j]=min(minn[j],cst[i]);
        if(minn[col[i]]<=p){
            f[i]=sum[col[i]];
        }
        else{
            f[i]+=before[col[i]];
        }
        sum[col[i]]++;
        before[col[i]]=f[i];minn[col[i]]=cst[i];
        ans[col[i]]=max(ans[col[i]],f[i]);
    }
    for(int i=1;i<=n;i++) ret+=f[i];
    cout<<ret<<endl;
    return 0;    
}