[백준] 33691 Arkain 대시보드 - Data Structure / Java

• 문제 링크

https://www.acmicpc.net/problem/33691

 

• 풀이 코드

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.HashSet;
import java.util.LinkedHashSet;
import java.util.List;
import java.util.Set;

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();

        Set<String> lset = new LinkedHashSet<>();
        int n = Integer.parseInt(br.readLine());
        while (n-- > 0) {
            String s = br.readLine();
            lset.remove(s);
            lset.add(s);
        }

        Set<String> set = new HashSet<>();
        int k = Integer.parseInt(br.readLine());
        while (k-- > 0) set.add(br.readLine());

        List<String> a = new ArrayList<>(), b = new ArrayList<>();
        for (String s : lset) {
            if (set.contains(s)) a.add(s);
            else b.add(s);
        }

        for (int i = a.size() - 1; i >= 0; i--) sb.append(a.get(i)).append('\n');
        for (int i = b.size() - 1; i >= 0; i--) sb.append(b.get(i)).append('\n');

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

}

 

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Map.Entry;

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 n = Integer.parseInt(br.readLine());
        while (n-- > 0) map.put(br.readLine(), n);

        int k = Integer.parseInt(br.readLine());
        while (k-- > 0) {
            String s = br.readLine();
            map.put(s, map.get(s) - 200000);
        }

        Pair[] arr = new Pair[map.size()];
        int i = 0;
        for (Entry<String, Integer> entry : map.entrySet()) arr[i++] = new Pair(entry.getKey(), entry.getValue());
        Arrays.sort(arr);

        for (Pair p : arr) sb.append(p.s).append('\n');

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

    private static class Pair implements Comparable<Pair> {
        String s;
        int i;

        Pair(String s, int i) {
            this.s = s;
            this.i = i;
        }

        @Override
        public int compareTo(Pair o) {
            return this.i - o.i;
        }
    }

}