| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 63326 | 王一涵（吃土豆长大的马铃薯） | 冒泡排序模板 | C++ | Compile Error | 0 MS | 0 KB | 1068 | 2025-03-27 16:55:07 |
Tests(0/0):
#include <iostream> using namespace std; int main() { int n; cin>>n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int j = 0; j < n - 1; j++) { for (int i = 0; i < n - 1; i++) { if (a[i] > a[i + 1]) { int m = a[i]; a[i] = a[i + 1]; a[i + 1] = m; } } } for (int i = 0; i < n; i++) { cout << a[i] << " "; } return 0; }#include <iostream> using namespace std; int main() { int n; cin>>n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int j = 0; j < n - 1; j++) { for (int i = 0; i < n - 1; i++) { if (a[i] > a[i + 1]) { int m = a[i]; a[i] = a[i + 1]; a[i + 1] = m; } } } for (int i = 0; i < n; i++) { cout << a[i] << " "; } return 0; }