| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 101597 | 陈馨逸 | 冒泡排序法 | C++ | Compile Error | 0 | 0 MS | 0 KB | 329 | 2023-09-09 11:10:55 |
#include <iostream> #include <cstdio> using namespace std; int main() { int n,i,j,minn; int a[1011]; 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]=min; } } } for(i=1;i<=n;i++)cout<<a[i]<<" "; return 0; }