• 문제 링크
https://www.acmicpc.net/problem/10184
• 풀이 코드
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringBuilder sb = new StringBuilder();
Map<String, Float> map = new HashMap<>();
int t = Integer.parseInt(br.readLine());
while (t-- > 0) {
StringTokenizer st = new StringTokenizer(br.readLine());
int x = Integer.parseInt(st.nextToken()), y = Integer.parseInt(st.nextToken());
float sum = 0;
while (x-- > 0) {
st = new StringTokenizer(br.readLine());
String k = st.nextToken();
float v = Float.parseFloat(st.nextToken());
map.put(k, v);
sum += v;
}
List<String> list = new ArrayList<>();
while (y-- > 0) {
st = new StringTokenizer(br.readLine());
String k = st.nextToken();
float v = Float.parseFloat(st.nextToken());
if (map.containsKey(k)) sum -= map.get(k) * v;
else list.add(k);
}
sb.append(Math.round(sum * 100) / 100.0).append('\n');
if (!list.isEmpty()) {
sb.append("INVALID COUPONS\n");
for (String k : list) sb.append(k).append('\n');
}
map.clear();
}
bw.write(sb.toString());
bw.flush();
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 15813 너의 이름은 몇 점이니? - Implementation / Java (0) | 2025.08.13 |
---|---|
[백준] 17094 Serious Problem - Implementation / Java (0) | 2025.08.12 |
[백준] 4813 User Names - Data Structure / Java (0) | 2025.08.10 |
[백준] 30571 Naming Wine Bottles - Data Structure / Java (0) | 2025.08.09 |
[백준] 5390 Gene Shuffle - Data Structure / Java (0) | 2025.08.08 |
댓글