Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.007 s | 1 KBi |
#3 |
Correcto
|
0.005 s | 2 KBi |
#4 |
Correcto
|
0.006 s | 1 KBi |
#5 |
Correcto
|
0.007 s | 2 KBi |
#6 |
Correcto
|
0.007 s | 1 KBi |
#7 |
Correcto
|
0.075 s | 2 KBi |
#8 |
Correcto
|
0.116 s | 2 KBi |
#9 |
Correcto
|
0.098 s | 2 KBi |
#10 |
Correcto
|
0.092 s | 2 KBi |
#11 |
Correcto
|
0.129 s | 3 KBi |
#12 |
Correcto
|
0.113 s | 3 KBi |
#13 |
Correcto
|
0.091 s | 3 KBi |
#14 |
Correcto
|
0.102 s | 3 KBi |
#15 |
Correcto
|
0.164 s | 2 KBi |
#16 |
Correcto
|
0.112 s | 2 KBi |
#17 |
Correcto
|
0.144 s | 3 KBi |
#18 |
Correcto
|
0.076 s | 2 KBi |
#19 |
Correcto
|
0.072 s | 2 KBi |
#20 |
Correcto
|
0.074 s | 2 KBi |
#21 |
Correcto
|
0.085 s | 3 KBi |
#22 |
Correcto
|
0.239 s | 2 KBi |
#23 |
Correcto
|
0.215 s | 2 KBi |
#24 |
Correcto
|
0.224 s | 3 KBi |
#25 |
Correcto
|
0.188 s | 2 KBi |
#26 |
Correcto
|
0.203 s | 3 KBi |
#27 |
Correcto
|
0.241 s | 2 KBi |
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int cases, x; cin >> cases; vector <int> numbers; while ( cases-- ){ cin >> x; numbers.push_back(x); } sort(numbers.begin(), numbers.begin() + numbers.size()); for(int i=0;i<numbers.size(); i++){ if (i+1 == numbers.size()) cout << numbers[i]; else cout << numbers[i] << " "; } cout << endl; return 0; }