[백준] 4351 Hay Points - Data Structure / Java

graycode 2024. 2. 3. 17:51

• 문제 링크

4351번: Hay Points

The first line of input contains 2 positive integers: m <= 1000, the number of words in the Hay Point dictionary, and n <= 100, the number of job descriptions. m lines follow; each contains a word (a string of up to 16 lower-case letters) and a dollar valu

www.acmicpc.net

• 풀이 코드

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.HashMap;
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();

        StringTokenizer st = new StringTokenizer(br.readLine());
        int m = Integer.parseInt(st.nextToken()), n = Integer.parseInt(st.nextToken());

        Map<String, Integer> map = new HashMap<>();
        while (m-- > 0) {
            st = new StringTokenizer(br.readLine());
            map.put(st.nextToken(), Integer.parseInt(st.nextToken()));
        }

        while (n-- > 0) {
            int sum = 0;
            String s;
            while (!(s = br.readLine()).equals(".")) {
                st = new StringTokenizer(s);
                while (st.hasMoreTokens()) sum += map.getOrDefault(st.nextToken(), 0);
            }
            sb.append(sum).append("\n");
        }

        bw.write(sb.toString());
        bw.flush();
    }

}