QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #24257 | #2291. Lopsided Lineup | jskop | Compile Error | / | / | Java8 | 860b | 2022-03-28 20:46:13 | 2022-05-18 04:15:53 |
Judging History
你现在查看的是最新测评结果
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2022-05-18 04:15:53]
- 评测
- 测评结果：Compile Error
- 用时：0ms
- 内存：0kb
- [2022-03-28 20:46:13]
- 提交
answer
import java.util.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Solution
{
public static void main(String[] args) {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
String line = "";
ArrayList<String> lines = new ArrayList<String>();
ArrayList<Integer> sums = new ArrayList<int>();
while(line!=null) {
line = reader.readLine();
}
int players = Integer.parseInt(lines.get(0));
for(int i=0; i<players; i++) {
int sum = 0;
for(String s: lines.get(i).split(" ")) {
sum += Integer.parseInt(s);
}
sums.add(sum);
}
Collections.sort(sums);
int max = 0;
int min = 0;
for(int i=0; i<players/2; i++) {
max += sums.get(players-i-1);
min += sums.get(i);
}
System.out.println((max-min)/2);
}
}
詳細信息
Solution.java:13: error: unexpected type ArrayList<Integer> sums = new ArrayList<int>(); ^ required: reference found: int 1 error