230042026-01-16 10:34:28linhnk20G (40 pont)cpp17Accepted 40/4046ms960 KiB
#include <bits/stdc++.h>
using namespace std;
using ll= long long;
using pii =pair<int, int>;
int main() {
	ll n, q, d=1;
	cin>>n>>q;
	vector<int> haz(n);
	vector<pii> tv(q);
	vector<ll> ki(q);
	for(int i=0; i<n; i++){
		cin>>haz[i];
	}
	for(int i=0; i<q; i++){
		cin>>tv[i].first;
		tv[i].second=i;
	}
	sort(tv.begin(), tv.end());
	int a=0;
	for(int i=0; i<q; i++){
		while(a<n&&tv[i].first>=haz[a]){
			d++; a++;
		}
		ki[tv[i].second]=d;
	}
	for(auto x:ki)
	cout<<x<<"\n";
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms508 KiB
2Accepted0/037ms820 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms384 KiB
6Accepted2/22ms428 KiB
7Accepted3/33ms432 KiB
8Accepted3/345ms960 KiB
9Accepted3/343ms960 KiB
10Accepted3/345ms960 KiB
11Accepted4/443ms820 KiB
12Accepted4/443ms820 KiB
13Accepted4/445ms956 KiB
14Accepted4/446ms820 KiB
15Accepted4/445ms820 KiB