-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLC2491.java
More file actions
59 lines (50 loc) · 1.43 KB
/
LC2491.java
File metadata and controls
59 lines (50 loc) · 1.43 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
53
54
55
56
57
58
59
/*
* LC2491
*/
import java.util.*;
public class LC2491 {
public static long dividePlayers(int[] skill) {
int n = skill.length;
int teams = n / 2;
int totalSum = 0;
int freqMap[] = new int[1001];
for (int element : skill) {
freqMap[element]++;
totalSum += element;
}
if (totalSum % teams != 0) {
return -1;
}
int targetPoints = totalSum / teams;
long res = 0;
for (int element : skill) {
if (freqMap[element] == 0) {
continue;
}
freqMap[element]--;
int partner = targetPoints - element;
if (freqMap[partner] == 0) {
return -1;
}
freqMap[partner]--;
res = res + ((long) element * (long) partner);
}
return res;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Enter Array Size : ");
int size = sc.nextInt();
System.out.println();
int arr[] = new int[size];
System.out.println("Enter The Array Elements : ");
for (int i = 0; i < arr.length; i++) {
System.out.printf("[%d] : ", i);
arr[i] = sc.nextInt();
}
System.out.println();
long ans = dividePlayers(arr);
System.out.println(ans);
sc.close();
}
}