sort (a + 1, a + 1 + n, less <int> ()); //less <int> ()可以不写,因为sort排序默认为升序 for (int i = 1; i <= n; ++i) printf ("%d ", a[i]); return 0; } 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 示例1 样例输入 10 10 9 8 7 6 5 4 3...