1049번) 기타줄 - 그리디

문제 출처 : https://www.acmicpc.net/problem/1049

import java.util.Scanner; public class Q1049 { static int eaNum; public static void main(String[] args) { Scanner sc = new Scanner(System.in); eaNum = sc.nextInt(); int shopNum = sc.nextInt(); int[] min = new int[2]; min[0] = sc.nextInt(); min[1] = sc.nextInt(); for ( int i = 1; i < shopNum; i++ ) { int setPrice = sc.nextInt(); min[0] = min[0] < setPrice ? min[0] : setPrice; int eaPrice = sc.nextInt(); min[1] = min[1] < eaPrice ? min[1] : eaPrice; } sc.close(); System.out.println(calResult(min)); } static int calResult(int[] min) { int result = 0; int setNum = eaNum / 6; int extraNum = eaNum % 6; if ( setNum > 0 ) { int temp1 = min[0] * setNum; int temp2 = min[1] * setNum * 6; result += temp1 < temp2 ? temp1 : temp2; } if ( extraNum > 0 ) { int temp1 = min[0]; int temp2 = min[1] * extraNum; result += temp1 < temp2 ? temp1 : temp2; } return result; } }