| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 137270 | 黄子轩 | 冒泡排序法 | C++ | Wrong Answer | 90 | 184 MS | 316 KB | 362 | 2024-03-09 17:51:50 |
#include<iostream> #include<cstdio> #include <bits/stdc++.h> using namespace std; int main(){ int long long n; cin>>n; int long long a[n]; for (int i=1;i<=n;i++){ cin>>a[i]; } for(int i=1;i<+n-1;i++){ for(int j=1;j<+n;j++){ if (a[j]>a[j+1]){ swap(a[j],a[j+1]); } } } for (int i=1;i<=n;i++){ cout<<a[i]<<" "; } }