메델_project

import java.util.PriorityQueue; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int n = kb.nextInt(); int answer = 0; PriorityQueue pq = new PriorityQueue(); for(int i=0; i1) { int a = pq.remove(); int b = pq.remove(); answer += a+ b; pq.add(a+b); } System.out.println(answer); } }

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int n = kb.nextInt(); int m = kb.nextInt(); int[] bucket = new int[n]; for(int t=0; t

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); StringBuilder sb = new StringBuilder(); int n = kb.nextInt(); int m = kb.nextInt(); int[][] arr = new int[n+1][n+1]; int[][] pre = new int[n+1][n+1]; for(int i=1; i

import java.util.ArrayList; import java.util.Collections; import java.util.List; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int n = kb.nextInt(); List list = new ArrayList(); for(int i=0; i

import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int n = kb.nextInt(); int[] location = new int[n]; for(int i=0; i

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int N = kb.nextInt(); int M = kb.nextInt(); int[] numbers = new int[N+1]; int[] sumNumbers = new int[N+1]; StringBuilder sb = new StringBuilder(); for(int i=1; i

import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); int n = kb.nextInt(); int[] scores = new int [n]; for(int i=0; i

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); String input; String longestWord = ""; while (!(input = scanner.next()).equals("E-N-D")) { String cleanedWord = input.replaceAll("[^a-zA-Z-]", ""); if (cleanedWord.length() > longestWord.length()) { longestWord = cleanedWord; } } System.out.println(longestWord.toLowerC..

import java.util.*; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); ArrayList list = new ArrayList(); for(int i=0; ilist.get(2)) { System.out.println(list.get(0)+ list.get(1)+ list.get(2)); }else { System.out.println((list.get(0)+ list.get(1))*2-1); } } }

import java.util.HashMap; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner kb = new Scanner(System.in); StringBuilder sb = new StringBuilder(); HashMap map = new HashMap(); int N = kb.nextInt(); int M = kb.nextInt(); for(int i=0; i