Envío 1836
- Autor: Javier
- Fecha: 2020-11-08 19:43:32 UTC (Hace alrededor de 3 años)
Caso # |
Resultado |
Tiempo |
Memoria |
#1 |

Correcto
|
0.005 s
|
1 KBi |
#2 |

Correcto
|
0.005 s
|
1 KBi |
#3 |

Correcto
|
0.005 s
|
1 KBi |
#4 |

Correcto
|
0.006 s
|
2 KBi |
#5 |

Correcto
|
0.005 s
|
1 KBi |
#6 |

Correcto
|
0.006 s
|
1 KBi |
#7 |

Correcto
|
0.006 s
|
1 KBi |
#8 |

Correcto
|
0.005 s
|
1 KBi |
#9 |

Correcto
|
0.005 s
|
1 KBi |
#10 |

Correcto
|
0.005 s
|
1 KBi |
#11 |

Correcto
|
0.01 s
|
1 KBi |
#12 |

Correcto
|
0.012 s
|
1 KBi |
#13 |

Correcto
|
0.009 s
|
1 KBi |
#14 |

Correcto
|
0.013 s
|
1 KBi |
#15 |

Correcto
|
0.013 s
|
1 KBi |
#16 |

Correcto
|
0.01 s
|
1 KBi |
#17 |

Correcto
|
0.013 s
|
1 KBi |
#18 |

Correcto
|
0.012 s
|
1 KBi |
#19 |

Correcto
|
0.013 s
|
1 KBi |
#20 |

Correcto
|
0.015 s
|
1 KBi |
Puntos totales: 100 / 100
Código
#include <iostream>
#include <vector>
using namespace std;
void bubble_sort(vector<int> &a) {
for (int i = 0; i < a.size() - 1; i++) {
for (int j = i + 1; j < a.size(); j++) {
int left = a[i];
int right = a[j];
// Swap positions
if (left > right) {
a[i] = right;
a[j] = left;
}
}
}
}
void print(const vector<int> &a) {
for (int i = 0; i < a.size(); i++) {
cout << a[i] << " ";
}
cout << endl;
}
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
bubble_sort(a);
print(a);
return 0;
}