| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 102203 | 周子博 | 冒泡排序法 | C++ | Accepted | 100 | 171 MS | 296 KB | 359 | 2023-09-12 13:52:57 |
#include<iostream> #include<cstdio> using namespace std; int main(){ int n,i,j,z,minn; int a[100005]; cin>>n; for(i=1;i<=n;i++){ cin>>a[i]; } for(i=1;i<=n-1;i++){ for(j=i+1;j<=n;j++){ if(a[i]>a[j]){ minn=a[j]; a[j]=a[i]; a[i]=minn; } } } for(i=1;i<=n-1;i++)cout<<a[i]<<" "; cout<<a[n]<<endl; return 0; }