O(n^2) 肯定会超时，~~你试试用递推做吧~~
```cpp
#include<iostream>
using namespace std;
int n,k,p;
int color,price;
int last[100],cnt[100],m[100];
int solutions;
int cafe;
int main(){
cin>>n>>k>>p;
for(int i=1;i<=n;i++){
cin>>color>>price;
if(price<=p) cafe=i;
if(cafe>=last[color]) m[color]=cnt[color];
solutions+=m[color];
last[color]=i;
cnt[color]++;
}
cout<<solutions<<endl;
return 0;
}
```
这个O(n)就没问题了
by Fearliciz @ 2020-08-18 08:19:39