Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 2 KBi |
#2 |
Correcto
|
0.006 s | 14 KBi |
#3 |
Correcto
|
0.005 s | 1 KBi |
#4 |
Correcto
|
0.006 s | 1 KBi |
#5 |
Correcto
|
0.009 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 2 KBi |
#7 |
Correcto
|
0.007 s | 2 KBi |
#8 |
Correcto
|
0.007 s | 12 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.007 s | 11 KBi |
#include <iostream> #include <list> using namespace std; int main() { int element, query; size_t elementsNumber, querysNumber, elementsGreaterThanQuery; list<int> elementsList; list<size_t> elemsGreaterList; // Get elements cin >> elementsNumber; for (size_t i = 0; i < elementsNumber; i++) { cin >> element; elementsList.push_back(element); } // Get Querys cin >> querysNumber; for (size_t i = 0; i < querysNumber; i++) { elementsGreaterThanQuery = 0; cin >> query; // Compare elements and querys for (auto const& i : elementsList) { if (i > query) { elementsGreaterThanQuery++; } } elemsGreaterList.push_back(elementsGreaterThanQuery); } // Print elements greater than query for (auto const& i : elemsGreaterList) { cout << i << endl; } }