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