233312026-01-19 17:36:26abcd20G (40 pont)cpp17Accepted 40/4059ms820 KiB
#include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;

int main(){
    int n,q;cin>>n>>q;
    vector<int> pref(n);
    cin>>pref[0];
    for(int i=1;i<n;i++){
        int x;cin>>x;
        pref[i]=max(pref[i-1],x);
    }
    while(q--){
        int x;cin>>x;
        cout<<upper_bound(pref.begin(),pref.end(),x)-pref.begin()+1<<'\n';
    }
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/048ms808 KiB
3Accepted2/21ms508 KiB
4Accepted2/21ms316 KiB
5Accepted2/23ms316 KiB
6Accepted2/24ms316 KiB
7Accepted3/34ms316 KiB
8Accepted3/359ms804 KiB
9Accepted3/357ms812 KiB
10Accepted3/359ms804 KiB
11Accepted4/457ms820 KiB
12Accepted4/459ms820 KiB
13Accepted4/459ms820 KiB
14Accepted4/459ms820 KiB
15Accepted4/457ms820 KiB