$O(n\lg n)$
#include<cstdio> #include<algorithm> int n, a[1000]; int main() { scanf("%d", &n); for (int i = 0; i < n; i++) scanf("%d", a + i); std::sort(a, a + n); for (int i = 0; i < n; i++) printf("%d\n", a[i]); return 0; }
#include<cstdio> #include<algorithm> int n, a[1000]; int main() { scanf("%d", &n); for (int i = 0; i < n; i++) scanf("%d", a + i); std::sort(a, a + n); for (int i = 0; i < n; i++) printf("%d\n", a[i]); return 0; }
댓글 없음 :
댓글 쓰기