Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /* b844 */
- /* AC (0.1s, 2.2MB) */
- #include <bits/stdc++.h>
- using namespace std;
- int N,Q;
- vector<int> K(500001);
- int main()
- {
- while(~scanf("%d %d", &N, &Q))
- {
- for(int i = 0; i < N; i++) scanf("%d", &K[i]);
- sort(K.begin(), K.begin() + N);
- for(int i = 0, x; i < Q && scanf("%d", &x); i++)
- {
- auto it = upper_bound(K.begin(), K.begin() + N, x);
- putchar(((it - K.begin()) & 1 )+ '0');
- putchar('\n');
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment