• 문제 링크
https://www.acmicpc.net/problem/18703
• 풀이 코드
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;
import java.util.TreeSet;
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, Integer> map = new HashMap<>();
        int t = Integer.parseInt(br.readLine());
        while (t-- > 0) {
            int n = Integer.parseInt(br.readLine());
            while (n-- > 0) {
                StringTokenizer st = new StringTokenizer(br.readLine());
                String key = st.nextToken();
                int val = Integer.parseInt(st.nextToken());
                if (!map.containsKey(key) || (map.containsKey(key) && map.get(key) > val)) map.put(key, val);
            }
            for (int i : new TreeSet<>(map.values())) sb.append(i).append(" ");
            sb.append("\n");
            map.clear();
        }
        bw.write(sb.toString());
        bw.flush();
    }
}'Problem Solving > Baekjoon' 카테고리의 다른 글
| [백준] 16300 H to O - Data Structure / Java (0) | 2024.06.02 | 
|---|---|
| [백준] 5366 Total Count - Data Structure / Java (0) | 2024.06.01 | 
| [백준] 24776 Recount - Data Structure / Java (0) | 2024.05.30 | 
| [백준] 7800 The Chosen Sub Matrix - Data Structure / Java (0) | 2024.05.29 | 
| [백준] 9863 Calling All Programmers - Data Structure / Java (0) | 2024.05.28 | 
 
										
									 
										
									 
										
									 
										
									
댓글