너T야? 나 T(story)야….

import java.io.*;import java.util.*;/*1.자주 나오는 단어일수록 앞에 배치한다.2.해당 단어의 길이가 길수록 앞에 배치한다.3.알파벳 사전 순으로 앞에 있는 단어일수록 앞에 배치한다 */public class HardWord { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); StringTokenizer st ..

import java.util.Arrays;import java.util.HashMap;import java.util.Map;import java.util.Scanner;public class Statistics { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int[] arr = new int[N]; int sum = 0; Map frequency = new HashMap(); for (int i = 0; i entry : frequency.entrySet()) { in..

import java.io.BufferedReader;import java.io.IOException;import java.io.InputStreamReader;import java.util.HashSet;import java.util.Set;public class ChongChong { public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); int N = Integer.parseInt(br.readLine()); Set s = new HashSet(); s.add("..