Algorithm

[백준-2751번/Java] 수 정렬하기 2

1984 2022. 11. 10. 22:22

* BufferedWriter 사용

import java.util.*;
import java.io.*;

public class Main {

	public static void main(String[] args) throws IOException {

		Scanner sc = new Scanner(System.in);
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

		int N = sc.nextInt();
		int[] numbers = new int[N];
		for (int i = 0; i < N; i++) {
			int num = sc.nextInt();
			numbers[i] = num;
		}

		Arrays.sort(numbers);
		for (int i = 0; i < N; i++) {
			bw.write(numbers[i] + "\n");
		}
		bw.flush();
		bw.close();
		sc.close();
	}

}

 

* System.out.println을 사용하면 시간초과

import java.util.*;
import java.io.*;

public class Main {

	public static void main(String[] args) throws IOException {

		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int[] numbers = new int[N];
		for (int i = 0; i < N; i++) {
			int num = sc.nextInt();
			numbers[i] = num;
		}

		Arrays.sort(numbers);
		for (int i = 0; i < N; i++) {
			System.out.println(numbers[i]);
		}

		sc.close();
	}

}
728x90