Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 0 KBi |
#2 |
Correcto
|
0.004 s | 0 KBi |
#3 |
Correcto
|
0.004 s | 0 KBi |
#4 |
Correcto
|
0.001 s | 0 KBi |
#5 |
Correcto
|
0.004 s | 0 KBi |
#6 |
Correcto
|
0.003 s | 0 KBi |
#7 |
Correcto
|
0.005 s | 4 KBi |
#8 |
Correcto
|
0.004 s | 0 KBi |
#9 |
Correcto
|
0.001 s | 0 KBi |
#10 |
Correcto
|
0.003 s | 0 KBi |
#11 |
Correcto
|
0.001 s | 0 KBi |
#12 |
Correcto
|
0.043 s | 2 KBi |
#13 |
Correcto
|
0.01 s | 1 KBi |
#14 |
Correcto
|
0.053 s | 1 KBi |
#15 |
Correcto
|
0.046 s | 1 KBi |
#16 |
Correcto
|
0.031 s | 1 KBi |
#17 |
Correcto
|
0.019 s | 1 KBi |
#include <bits/stdc++.h> using namespace std; void _print() { cerr << "]" << endl; } template<typename T, typename... V> void _print(T t, V... v) { cerr << t; if (sizeof...(v)) cerr << ", "; _print(v...); } #ifdef LOCAL #define dbg(x...) cerr << "[" << #x << "]: ["; _print(x) #else #define dbg(x...) #define endl '\n' #endif #define ll long long #define sz(x) int(x.size()) int main() { ios_base::sync_with_stdio(false); cin.tie(0); int n; while (cin >> n) { int arr[n]; for (int &i : arr) cin >> i; int c; cin >> c; while (c--) { int x; cin >> x; cout << int(upper_bound(arr, arr + n, x) - arr) << endl; } } return 0; }