did_story
[๋ฐฑ์ค / JAVA] 1049 ๊ธฐํ์ค ๋ณธ๋ฌธ
ํ์ด
์ํ๋ฌธ์ ์ค 1๊ฐ๋ก ์ ๊ทผํ์๋ค.
๊ฐ ๋ธ๋๋ ์ค์์ ํํค์ง, ๋ฑ๊ฐ์์ ๊ฐ์ฅ ์์ ๊ฐ์ ๊ฐ์ ธ์ค๊ณ ,
1. ๋ฑ๊ฐ 6๊ฐ๋ฅผ ๊ณฑํ ๊ฒ์ด ํจํค์ง ๋ณด๋ค ์์ ๋,
2. ํน์ ํจํค์ง๋ฅผ ๋ค ๋ถ๋ฐฐํด ๋๊ณ ๋๋จธ์ง์ ์ด ๊ฐ๊ฒฉ์ด ํจํค์ง๋ณด๋ค ๊ฐ๊ฒฉ์ด ๋ ๋๊ฐ ๋.
๋ฅผ ๊ณ ๋ คํ์ฌ ๊ณ์ฐํ์๋ค.
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Main {
static int n, m;
static int[][] com;
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
n = Integer.parseInt(st.nextToken());
m = Integer.parseInt(st.nextToken());
com = new int[m][2];
for (int i = 0; i < m; i++) {
st = new StringTokenizer(br.readLine());
int a = Integer.parseInt(st.nextToken());
int b = Integer.parseInt(st.nextToken());
com[i][0] = a;
com[i][1] = b;
}
int pack = Integer.MAX_VALUE;
int piece = Integer.MAX_VALUE;
for (int i = 0; i < m; i++) {
if (com[i][0] < pack) pack = com[i][0];
if (com[i][1] < piece) piece = com[i][1];
}
int result = 0;
if(piece * 6 <= pack)
result = piece * n;
else{
result = (n/6) * pack;
if(n%6 * piece <= pack)
result += (n%6) * piece;
else
result += pack;
}
System.out.println(result);
}
}
'Algorithm๐ > ๋ฐฑ์ค(BOJ)' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
[๋ฐฑ์ค / JAVA] 1080๋ฒ, ํ๋ ฌ (Greedy) (3) | 2024.12.27 |
---|---|
[๋ฐฑ์ค / JAVA] 11399๋ฒ, ATM (Greedy) (2) | 2024.12.24 |
[๋ฐฑ์ค / JAVA] 1717๋ฒ, ์งํฉ์ ํํ (Union-Find) (3) | 2024.12.23 |