| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 140879 | 汪义罗 | 19从小到大进行排序 | C++ | Output Limit Exceeded | 0 MS | 268 KB | 547 | 2025-12-20 14:10:27 |
#include <iostream> using namespace std; int main() { int n,f; cin >> n; int a[2000]; for (int i =1; i <= n; i++) { cin >> a[i]; } for (int j =1; j < n; j++) { for (int i = 1; i < n; i++) { if (a[i] < a[i+1]) { f=a[i]; a[i] = a[i+1]; a[i+1] =f; } } for (int i = 1; i <= n; i++) { cout << a[i]<<" "; } cout<<endl; } return 0; }