-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCodechef_LRNDSA01_ZCO14003.java
125 lines (114 loc) · 2.89 KB
/
Codechef_LRNDSA01_ZCO14003.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
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
/* package codechef; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
class Codechef_LRNDSA01_ZCO14003
{
static PrintWriter out=new PrintWriter((System.out));
public static void main(String args[])throws IOException
{
Reader sc=new Reader();
int t=sc.nextInt();
ArrayList<Long> tree = new ArrayList<Long>();
while(t-->0)
{
tree.add(sc.nextLong());
}
Collections.sort(tree);
long max = 0;
for(int i = 0; i<tree.size();i++) {
long curr = (tree.size()-i)*tree.get(i);
if(curr>max) {
max = curr;
}
}
out.println(max);
out.close();
}
private static boolean isLapindrome(String lapInp) {
int len = lapInp.length();
HashMap<Character, Integer> frqMap = new HashMap<Character, Integer>();
for(int i =0,j=len-1; i<j;i++,j--) {
char left = lapInp.charAt(i);
char right = lapInp.charAt(j);
if(frqMap.containsKey(left)) {
frqMap.put(left, frqMap.get(left)+1);
}else {
frqMap.put(left,1);
}
if(frqMap.containsKey(right)) {
frqMap.put(right, frqMap.get(right)-1);
}else {
frqMap.put(right,-1);
}
}
for(int value: frqMap.values()) {
if(value!=0) {
return false;
}
}
return true;
}
static class Reader
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st=new StringTokenizer("");
public String next()
{
while(!st.hasMoreTokens())
{
try
{
st=new StringTokenizer(br.readLine());
}
catch(Exception e)
{
e.printStackTrace();
}
}
return st.nextToken();
}
public int nextInt()
{
return Integer.parseInt(next());
}
public long nextLong()
{
return Long.parseLong(next());
}
public double nextDouble()
{
return Double.parseDouble(next());
}
public String nextLine()
{
try
{
return br.readLine();
}
catch(Exception e)
{
e.printStackTrace();
}
return null;
}
public boolean hasNext()
{
String next=null;
try
{
next=br.readLine();
}
catch(Exception e)
{
}
if(next==null)
{
return false;
}
st=new StringTokenizer(next);
return true;
}
}
}