Skip to content

Commit e028680

Browse files
committed
[D2] Title: 숫자를 정렬하자, Time: 76 ms, Memory: 24,832 KB -BaekjoonHub
1 parent 7694774 commit e028680

File tree

2 files changed

+45
-0
lines changed

2 files changed

+45
-0
lines changed
Lines changed: 15 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,15 @@
1+
# [D2] 숫자를 정렬하자 - 1966
2+
3+
[문제 링크](https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5PrmyKAWEDFAUq)
4+
5+
### 성능 요약
6+
7+
메모리: 24,832 KB, 시간: 76 ms, 코드길이: 845 Bytes
8+
9+
### 제출 일자
10+
11+
2025-10-06 16:19
12+
13+
14+
15+
> 출처: SW Expert Academy, https://swexpertacademy.com/main/code/problem/problemList.do
Lines changed: 30 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,30 @@
1+
import java.util.*;
2+
import java.io.*;
3+
4+
class Solution
5+
{
6+
public static void main(String args[]) throws Exception
7+
{
8+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
9+
StringBuilder sb = new StringBuilder();
10+
int T = Integer.parseInt(br.readLine());
11+
12+
for(int i=1; i<=T; i++){
13+
int N = Integer.parseInt(br.readLine());
14+
StringTokenizer st = new StringTokenizer(br.readLine());
15+
int[] arr = new int[N];
16+
for(int j=0; j<N; j++){
17+
arr[j] = Integer.parseInt(st.nextToken());
18+
}
19+
20+
Arrays.sort(arr);
21+
22+
sb.append("#"+i+" ");
23+
for(int j=0; j<N; j++){
24+
sb.append(arr[j] + " ");
25+
}
26+
sb.append("\n");
27+
}
28+
System.out.println(sb);
29+
}
30+
}

0 commit comments

Comments
 (0)