-
Notifications
You must be signed in to change notification settings - Fork 0
/
UVa 10611.cpp
77 lines (69 loc) · 1.69 KB
/
UVa 10611.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
/*BISMILLAHIR RAHMANIR RAHIM*/
#include<bits/stdc++.h>
#include<string>
#define lli long long int
#define case(ans) printf("Case %d: %d\n", k, ans)
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define check cout << "\tOK" << endl
#define PI acos(-1.0)
#define loop(a, n, x) for(int i=a; i<=n; i+=x)
#define npoint(x) fixed << setprecision(x)
#define ALL(x) x.begin(), x.end()
#define rev(x) reverse(x.begin(), x.end())
#define pb(x) push_back(x)
#define ppb pop_back()
#define pf(x) push_front(x)
#define ppf pop_front()
#define mii map<int, int>
#define mci map<char, int>
#define mib map<int, bool>
#define dqi deque<int>
#define maxiii(a, b, c) max(max(a, b), c)
#define miniii(a, b, c) min(min(a, b), c)
#define vec vector<int>
#define pr pair<int, int>
#define NUM 1000000
//int *ar=(int *) malloc(n*sizeof(int)); dynamic memory allocation (array)
/*-----------------ANUPAM AKIB-------------------*/
using namespace std;
int main(){
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int n, q;
cin >> n;
int a[n+3];
for(int i=0; i<n; i++){
cin >> a[i];
}
cin >> q;
int b[q+3];
for(int i=0; i<q; i++){
cin >> b[i];
}
for(int i=0; i<q; i++){
int x=-1, y=-1;
for(int j=0; j<n; j++){
if(a[j]<b[i]){
x=a[j];
}
if(a[j]>b[i]){
y=a[j];
break;
}
}
if(x==-1){
cout << "X ";
}
else{
cout << x << " ";
}
if(y==-1){
cout << "X" << endl;
}
else{
cout << y << endl;
}
}
return 0;
}