| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 101686 | 方文轩 | 插入排序 | C++ | Accepted | 100 | 0 MS | 256 KB | 324 | 2023-09-09 21:48:03 |
#include<iostream> using namespace std; int a[10001]; int main() { int x,k,n=1; cin>>x; for(int i=1;i<=x;i++) cin>>a[i]; cin>>k; if(k>a[x]) { a[x+1]=k; goto x; } while(a[n]<k) n++; for(int i=x;i>=n;i--) { a[i+1]=a[i]; } a[n]=k; x: for(int i=1;i<=x+1;i++) cout<<a[i]<<" "; }