| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 137139 | 刘子隽bylz | 冒泡排序法 | C++ | Runtime Error | 14 | 1 MS | 260 KB | 270 | 2024-03-09 17:36:05 |
#include<bits/stdc++.h> using namespace std; int main(){ int i,j,k,n,a[11]; cin>>n; for(i=1;i<=n;i++){ cin>>a[i]; } for(int l=1;l<n;l++) for(j=1;j<=n-l;j++) if(a[j]>a[j+1]) swap(a[j],a[j+1]); for(k=0;k<n;k++) cout<<a[k+1]<<" "; return 0; }