개발생각

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;

public class Main {

	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		
		int n = Integer.parseInt(br.readLine());
		int[] arr = new int[n];
		
		for(int i=0;i<n;i++) {
			arr[i] = Integer.parseInt(br.readLine());
		}
		
		Arrays.sort(arr);
		
		for(int i=0;i<n;i++) {
			sb.append(arr[i]).append('\n');
		}
		
		// ArrayList > Collections.Sort = 시간 초과
		// 배열 > Arrays.Sort = 시간초과
		// 입력 Scanner 아닌 BufferedReader 처리
		// 출력 StringBuilder 처리
		
		System.out.println(sb);
	}

}

import java.util.Scanner;

//Q) 동전0 #11047
public class Main {


	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt(); //동전의 개수
		int k = sc.nextInt(); //가치의 합
		
		int[] coins = new int[n];
		int cnt=0;
		int bigIndex =0;
		
		for(int i=0;i<coins.length;i++){
			coins[i] = sc.nextInt();
		}
	
		while(k!=0){
			for(int i=0;i<coins.length;i++){
				if(coins[i]<=k){
					bigIndex=i;
				}
			}
			k=k-coins[bigIndex];
			cnt++;
		}
		
		System.out.println(cnt);
			
	}
	
}

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int k = sc.nextInt();
		int result = 0;
		int div = 0;
		
		if(k ==0){
			result = 1;
		}else{
			result = n;
			div = k;
			for(int i=1;i<k;i++){
				result *= n-i;
				div *= k-i;
			}
			result = result/div;
		}
		System.out.println(result);
		
	}
}

import java.util.Arrays;
import java.util.Scanner;

//Q) ATM #11399
public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int[] p = new int[n];
		for(int i=0;i<n;i++){
			p[i] = sc.nextInt();
		}
		
		int result =0;
		
		Arrays.sort(p);
		for(int i=0;i<p.length;i++){
			for(int j=0;j<=i;j++){
				result+=p[j];
			}
		}
		
		System.out.println(result);
	}
}

import java.util.Arrays;
import java.util.Scanner;


public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub

		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		
		int[][] arr = new int[n][2];
		
		for(int i=0;i<n;i++) {
			int x = sc.nextInt();
			int y = sc.nextInt();
			
			arr[i][0] = x;
			arr[i][1] = y;
		}
		
		Arrays.sort(arr, (e1, e2) ->{
			if(e1[0] == e2[0]) {
				return e1[1]-e2[1];
			} else {
				return e1[0] - e2[0];
			}
		});
		
		for(int i=0; i<n;i++) {
			System.out.println(arr[i][0] + " " + arr[i][1]);
		}
	}

}