File tree Expand file tree Collapse file tree 2 files changed +45
-0
lines changed
Expand file tree Collapse file tree 2 files changed +45
-0
lines changed Original file line number Diff line number Diff line change 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
Original file line number Diff line number Diff line change 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+ }
You can’t perform that action at this time.
0 commit comments