-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathQ1744.java
More file actions
52 lines (46 loc) · 1.64 KB
/
Q1744.java
File metadata and controls
52 lines (46 loc) · 1.64 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
49
50
51
52
/**
* Date: 2018. 9. 17.
* Author: inhyuck | https://github.com/inhyuck
* Solution URL: https://github.com/skhucode/skhucode-inhyuck
* Title: 수 묶기
* Problem: 링크 참조
* URL: https://www.acmicpc.net/problem/1744
*/
package io.inhyuck.greedy;
import java.util.*;
public class Q1744 {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
Queue<Integer> positiveNumber = new PriorityQueue<>(Collections.reverseOrder());
Queue<Integer> negativeNumber = new PriorityQueue<>();
int temp, result = 0;
for (int i = 0; i < n; i++) {
temp = scanner.nextInt();
if (temp == 1) {
result += 1;
} else if (temp <= 0) {
negativeNumber.add(temp);
} else if (temp > 1) {
positiveNumber.add(temp);
}
}
// System.out.println(positiveNumber.toString());
// System.out.println(negativeNumber.toString());
int sizeOfNegetiveNumber = negativeNumber.size();
int sizeOfPositiveNumber = positiveNumber.size();
for (int i = 0; i < sizeOfNegetiveNumber / 2; i++) {
result += negativeNumber.poll() * negativeNumber.poll();
}
if (!negativeNumber.isEmpty()) {
result += negativeNumber.poll();
}
for (int i = 0; i < sizeOfPositiveNumber / 2; i++) {
result += positiveNumber.poll() * positiveNumber.poll();
}
if (!positiveNumber.isEmpty()) {
result += positiveNumber.poll();
}
System.out.println(result);
}
}