Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.008 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.003 s | 1 KBi |
#6 |
Correcto
|
0.005 s | 1 KBi |
#7 |
Correcto
|
0.006 s | 1 KBi |
#8 |
Correcto
|
0.004 s | 1 KBi |
#9 |
Correcto
|
0.005 s | 1 KBi |
#10 |
Correcto
|
0.005 s | 1 KBi |
#11 |
Correcto
|
0.01 s | 3 KBi |
#12 |
Correcto
|
0.008 s | 1 KBi |
#13 |
Correcto
|
0.01 s | 1 KBi |
#14 |
Correcto
|
0.008 s | 1 KBi |
#15 |
Correcto
|
0.01 s | 1 KBi |
#16 |
Correcto
|
0.01 s | 1 KBi |
#17 |
Correcto
|
0.007 s | 1 KBi |
#18 |
Correcto
|
0.013 s | 1 KBi |
#19 |
Correcto
|
0.01 s | 1 KBi |
#20 |
Correcto
|
0.013 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 alive = n; for (int next = 0; next < n; next++) { // Find the smallest element among the elements that are alive. for (int i = 0; i < alive-1; i++) { if (input[i] < input[alive-1]) { swap(input[i], input[alive-1]); } } // Here, input[best] is the smallest one. output[next] = input[alive-1]; // Delete element at position best. alive--; } for (int i = 0; i < n; i++) { if (i > 0) cout << " "; cout << output[i]; } cout << endl; return 0; }