Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.005 s | 1 KBi |
#2 |
Correcto
|
0.009 s | 1 KBi |
#3 |
Correcto
|
0.006 s | 6 KBi |
#4 |
Correcto
|
0.005 s | 2 KBi |
#5 |
Correcto
|
0.005 s | 4 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.004 s | 2 KBi |
#8 |
Correcto
|
0.004 s | 2 KBi |
#9 |
Correcto
|
0.006 s | 1 KBi |
#10 |
Correcto
|
0.005 s | 2 KBi |
#11 |
Correcto
|
0.011 s | 2 KBi |
#12 |
Correcto
|
0.012 s | 3 KBi |
#13 |
Correcto
|
0.009 s | 1 KBi |
#14 |
Correcto
|
0.011 s | 4 KBi |
#15 |
Correcto
|
0.011 s | 2 KBi |
#16 |
Correcto
|
0.01 s | 1 KBi |
#17 |
Correcto
|
0.008 s | 1 KBi |
#18 |
Correcto
|
0.008 s | 2 KBi |
#19 |
Correcto
|
0.009 s | 1 KBi |
#20 |
Correcto
|
0.009 s | 1 KBi |
#include <iostream> #include <vector> using namespace std; int main() { int n; cin >> n; vector<int> arr(n); for (int i = 0; i < n; i++) { cin >> arr[i]; } vector<int> output(n); int next = 0; int alive = n; while (next < n) { int smallest = 0; for (int i = 1; i < alive; i++) { if (arr[i] < arr[smallest]) { smallest = i; } } output[next] = arr[smallest]; swap(arr[smallest], arr[alive - 1]); alive--; next++; } for (int i = 0; i < n; i++) { if (i > 0) cout << " "; cout << output[i]; } cout << endl; return 0; }