Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.006 s | 35 KBi |
#2 |
Correcto
|
0.006 s | 2 KBi |
#3 |
Correcto
|
0.006 s | 1 KBi |
#4 |
Correcto
|
0.005 s | 1 KBi |
#5 |
Correcto
|
0.006 s | 2 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.005 s | 1 KBi |
#8 |
Correcto
|
0.006 s | 1 KBi |
#9 |
Correcto
|
0.006 s | 1 KBi |
#10 |
Correcto
|
0.006 s | 1 KBi |
#include <iostream> #include <set> using namespace std; void splitArray(int n, multiset<int> &a, int query) { multiset<int>::iterator itr; int index = 0; for (itr = a.begin(); itr != a.end(); ++itr) { if (query < *itr) { cout << n - index << endl; return; } ++index; } cout << 0 << endl; } int main() { int n; cin >> n; multiset<int> a; for (int i = 0; i < n; ++i) { int val; cin >> val; a.insert(val); } int c; cin >> c; for (int i = 0; i < c; ++i) { int query; cin >> query; splitArray(n, a, query); } }