提交时间:2024-08-19 22:03:50

运行 ID: 168051

#include <iostream> using namespace std; const long long MAX_SIZE = 10000005; long long order[MAX_SIZE]; long long n; int main() { cin >> n; long long maxVal = 0; long long minVal = MAX_SIZE; for (long long i = 0; i < n; i++) { cin >> sta; order[sta]++; if (sta > maxVal) maxVal = sta; if (sta < minVal) minVal = sta; } for (long long i = minVal; i <= maxVal; i++) { while (order[i] > 0) { cout << i << " "; order[i]--; } } return 0; }