-
Notifications
You must be signed in to change notification settings - Fork 1.1k
/
Main.java
63 lines (53 loc) · 1.72 KB
/
Main.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
//Authored by : suin8
//Co-authored by : -
//Link : http://boj.kr/a334ac368b9b42b9a9cb34e313c6cd3b
import java.util.*;
import java.io.*;
public class Main {
static Vector<Integer> rope = new Vector<Integer>();
public static void main(String[] args) {
FastReader rd = new FastReader();
int N = rd.nextInt();
for(int i = 0;i < N; i++)
rope.add(rd.nextInt());
// 오름차순으로 정렬
Collections.sort(rope);
// 기본값을 가장 작은 무게 * N개 로 지정하고
// 1개씩 rope를 줄여가며 더 많이 들 수 있는 경우를 본다.
int weight = rope.get(0) * N;
for(int i = 1;i < N;i++) {
if(rope.get(i) * (N - i) > weight)
weight = rope.get(i) * (N - i);
}
System.out.print(weight);
}
static class FastReader {
BufferedReader br;
StringTokenizer st;
public FastReader() {
br = new BufferedReader(new InputStreamReader(System.in));
}
String next() {
while(st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
}
catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt() { return Integer.parseInt(next()); }
String nextLine() {
String str = "";
try {
str = br.readLine();
}
catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
}