Caso # | Resultado | Tiempo | Memoria |
---|---|---|---|
#1 |
Correcto
|
0.004 s | 4 KBi |
#2 |
Correcto
|
0.002 s | 0 KBi |
#3 |
Correcto
|
0.005 s | 9 KBi |
#4 |
Correcto
|
0.006 s | 39 KBi |
#5 |
Correcto
|
0.004 s | 19 KBi |
#6 |
Correcto
|
0.002 s | 1 KBi |
#7 |
Correcto
|
0.001 s | 0 KBi |
#8 |
Correcto
|
0.001 s | 0 KBi |
#9 |
Correcto
|
0.002 s | 0 KBi |
#10 |
Correcto
|
0.002 s | 0 KBi |
#11 |
Correcto
|
0.003 s | 0 KBi |
#12 |
Correcto
|
0.009 s | 1 KBi |
#13 |
Correcto
|
0.005 s | 3 KBi |
#14 |
Correcto
|
0.003 s | 0 KBi |
#15 |
Correcto
|
0.003 s | 0 KBi |
#16 |
Correcto
|
0.002 s | 0 KBi |
#17 |
Correcto
|
0.006 s | 1 KBi |
#18 |
Correcto
|
0.006 s | 13 KBi |
#19 |
Correcto
|
0.006 s | 1 KBi |
#20 |
Correcto
|
0.006 s | 8 KBi |
#include <bits/stdc++.h> using namespace std; void printArray(int arr[], int size) { for (int i=0; i < size; i++) cout << arr[i] << " "; cout << endl; } int main() { int n; cin>>n; int arr[n]; for(int i = 0; i < n; i++) { cin>>arr[i]; } for(int i = 0; i < n-1; i++) { int minIndex = i; for(int j = i+1; j < n; j++) { if(arr[j] < arr[minIndex]) minIndex = j; } int temp = arr[i]; arr[i] = arr[minIndex]; arr[minIndex] = temp; } printArray(arr, n); return 0; }