| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 127317 | 周震东 | 插入排序 | C++ | Wrong Answer | 0 | 0 MS | 260 KB | 454 | 2024-01-25 08:39:36 |
#include <bits/stdc++.h> using namespace std; long long abc[11111111]; int main() { long long a , b , c , d , e , f , g , h , i , j , k , l , m , n , o , p , q , r , s , t , u , v , w ,x , y , z ,cnt = 0, sum = 0, max , min , mun = 1; cin >> n; for(long long i = 0 ; i < n ; i++){ cin >> abc[i]; } cin >> x; abc[n] = x; sort(abc, abc + n); for(long long i = 0 ; i < n ; i++){ cout << abc[i] << " "; } return 0; }