| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 127490 | 黄恩宁 | 冒泡排序法 | C++ | Accepted | 100 | 69 MS | 292 KB | 317 | 2024-01-25 09:15:54 |
#include<iostream> #include<cstdio> using namespace std; const int NR=100010; int a[NR]; int main() { int n,i,j; cin>>n; for(i=1;i<=n;i++) cin>>a[i]; if(a[1]<0) a[0]=-2e9; for(i=n;i>=1;i--) for(j=i;j<=n;j++) if(a[j]<a[j-1]) swap(a[j],a[j-1]); for(i=1;i<=n;i++) cout<<a[i]<<" "; return 0; }