-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQ11652.java
More file actions
48 lines (45 loc) Β· 1.74 KB
/
Q11652.java
File metadata and controls
48 lines (45 loc) Β· 1.74 KB
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
/**
* Date: 2018. 08. 16.
* Author: inhyuck | https://github.com/inhyuck
* Solution URL: https://github.com/skhucode/skhucode-inhyuck
* Title: μΉ΄λ
* Problem: μ€κ·λ μ«μ μΉ΄λ Nμ₯μ κ°μ§κ³ μλ€.
* μ«μ μΉ΄λμλ μ μκ° νλ μ νμλλ°, μ νμλ μλ -262λ³΄λ€ ν¬κ±°λ κ°κ³ , 262λ³΄λ€ μκ±°λ κ°λ€.
* μ€κ·κ° κ°μ§κ³ μλ μΉ΄λκ° μ£Όμ΄μ‘μ λ, κ°μ₯ λ§μ΄ κ°μ§κ³ μλ μ μλ₯Ό ꡬνλ νλ‘κ·Έλ¨μ μμ±νμμ€.
* λ§μ½, κ°μ₯ λ§μ΄ κ°μ§κ³ μλ μ μκ° μ¬λ¬κ°μ§λΌλ©΄, μμ κ²μ μΆλ ₯νλ€.
* URL: https://www.acmicpc.net/problem/11652
*/
package io.inhyuck.sort;
import java.io.*;
import java.util.Arrays;
public class Q11652 {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
int t = Integer.parseInt(reader.readLine());
long[] numbers = new long[t];
for (int i = 0; i < t; i++) {
numbers[i] = Long.parseLong(reader.readLine());
}
Arrays.sort(numbers);
int count = 1;
int maxCount = 1;
Long largeSizeNumber = numbers[0];
for (int i = 1; i < t; i++) {
if (numbers[i - 1] == numbers[i]) {
count++;
continue;
}
if (maxCount < count) {
maxCount = count;
largeSizeNumber = numbers[i - 1];
}
count = 1;
}
//λ§μ§λ§ μΉ΄λκ° κ°μ₯ λ§μ΄ μλ μΉ΄λμμ κ²½μ°
if (maxCount < count) {
maxCount = count;
largeSizeNumber = numbers[numbers.length - 1];
}
System.out.println(largeSizeNumber);
}
}