题解 | 琪露诺的 K 维偏序

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
int main()
{
    ll n,q;
    cin>>n>>q;
    vector<ll>a(n);
    for(int i = 0;i<n;i++){
        cin>>a[i];
    }
    sort(a.begin(),a.end());
    while(q--){
        ll m,n;
        cin>>m>>n;
        ll pos = a[m-1];
        if(pos<n){
            cout<<"yes"<<endl;
        }
        else cout<<"NO"<<endl;
    }
    return 0;
}