Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <algorithm>
- #include <vector>
- #include <map>
- #define lli long long int
- using namespace std;
- int main(){
- lli n, x, r;
- cin >> n;
- lli a[n], b[n];
- for(int i = 0; i < n; i++){
- cin >> a[i];
- }
- sort(a, a+n);
- int duplicate = 0;
- for(int i = 1; i < n; i++){
- if(a[i] <= a[i-1]){
- duplicate++;
- }
- }
- cin >> x;
- for(int i = 0; i < x; i++){
- cin >> b[i];
- if(b[i] >= a[0]){
- lli x = b[i];
- lli ans = lower_bound(a, a+n, x) - a + 1;
- cout << ans + duplicate << endl;
- }
- else{
- cout << 0 << endl;
- }
- }
- }
Add Comment
Please, Sign In to add comment