Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int tab[1000000];
- int lower_b(int p, int k, int sz)
- {
- int s;
- if(p<k)
- {
- s = (p+k)/2;
- if(sz<=tab[s]) return lower_b(p,s,sz);
- else return lower_b(s+1,k,sz);
- }
- return p;
- }
- int main()
- {
- int n;
- cin>>n;
- for(int i = 0; i < n; i++) cin>>tab[i];
- int k,sz;
- cin>>k;
- for(int i = 0; i < k; i++) {
- cin>>sz;
- if(tab[n-1]>=sz) cout<<lower_b(0,n-1,sz)+1<<" ";
- else cout<<"b ";
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement