题解 | #小猫排队#

没看到题解用pq写的，感觉这样写比较方便。

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> a(n+1);
    priority_queue<int> pq;
    for(int i = 1; i <= n; ++i){
        cin >> a[i];
    }
    int c;
    cin >> c;
    for(int i =1; i <= n; ++i){
        if(a[i] > c) pq.push(i);
    }
    int t= 0;
    int p=n+1;
    while(pq.size()){
        auto x = pq.top();
        pq.pop();
        if(x <= t) break;
        p = x;
        t++;
    }
    int ans = p;
    cout << ans << '\n';
}