Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.007 s | 1 KBi |
#2 |
Correcto
|
0.006 s | 6 KBi |
#3 |
Correcto
|
0.006 s | 15 KBi |
#4 |
Correcto
|
0.008 s | 2 KBi |
#5 |
Correcto
|
0.006 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 7 KBi |
#7 |
Correcto
|
0.006 s | 1 KBi |
#8 |
Correcto
|
0.005 s | 1 KBi |
#9 |
Correcto
|
0.005 s | 32 KBi |
#10 |
Correcto
|
0.005 s | 1 KBi |
#11 |
Correcto
|
0.007 s | 13 KBi |
#12 |
Correcto
|
0.007 s | 7 KBi |
#13 |
Correcto
|
0.006 s | 1 KBi |
#14 |
Correcto
|
0.007 s | 2 KBi |
#15 |
Correcto
|
0.007 s | 1 KBi |
#16 |
Correcto
|
0.008 s | 2 KBi |
#17 |
Correcto
|
0.006 s | 1 KBi |
#18 |
Correcto
|
0.009 s | 1 KBi |
#19 |
Correcto
|
0.008 s | 2 KBi |
#20 |
Correcto
|
0.007 s | 1 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; }