• 문제 링크
https://www.acmicpc.net/problem/30088
• 풀이 코드
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.Arrays;
public class Main {
public static void main(String[] args) throws IOException {
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
int n = read();
long[] sums = new long[n];
while (n-- > 0) {
int[] arr = new int[read()];
for (int i = 0; i < arr.length; i++) arr[i] = read();
Arrays.sort(arr);
for (int i : arr) sums[n] += i;
}
Arrays.sort(sums);
long sum = 0, tmp = 0;
for (long l : sums) sum += tmp += l;
bw.write(String.valueOf(sum));
bw.flush();
}
private static int read() throws IOException {
int c, n = System.in.read() & 15;
while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);
return n;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 25335 Gravity Hackenbush - Greedy / Java (0) | 2024.05.13 |
---|---|
[백준] 16756 Pismo - Greedy / Java (0) | 2024.05.12 |
[백준] 13238 Bitcoin investment - Greedy / Java (0) | 2024.05.10 |
[백준] 4852 Winter Festival - Graph Theory / Java (0) | 2024.05.09 |
[백준] 7107 Journey of A Knight - Graph Theory / Java (0) | 2024.05.08 |
댓글