| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 168186 | 万曜诚 | 常用排序法 | C++ | Accepted | 100 | 29 MS | 644 KB | 375 | 2024-08-19 23:37:08 |
#include <algorithm> #include <iostream> int main() { using namespace std; int n; cin >> n; int vec[n]; if (n> 100000) {return 1;} for (int i = 0; i < n; ++i) { cin >> vec[i]; } sort(vec, vec+n); for (int n : vec) { cout << n << ' '; } cout << '\n'; return 0; }