結果
問題 | No.1708 Quality of Contest |
ユーザー | tenten |
提出日時 | 2023-04-19 08:30:45 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 981 ms / 2,000 ms |
コード長 | 2,631 bytes |
コンパイル時間 | 3,003 ms |
コンパイル使用メモリ | 84,368 KB |
実行使用メモリ | 65,016 KB |
最終ジャッジ日時 | 2024-04-22 09:01:56 |
合計ジャッジ時間 | 21,682 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 54 ms
46,344 KB |
testcase_01 | AC | 56 ms
46,536 KB |
testcase_02 | AC | 55 ms
46,332 KB |
testcase_03 | AC | 139 ms
48,736 KB |
testcase_04 | AC | 154 ms
48,880 KB |
testcase_05 | AC | 146 ms
49,172 KB |
testcase_06 | AC | 140 ms
49,016 KB |
testcase_07 | AC | 139 ms
48,904 KB |
testcase_08 | AC | 53 ms
46,052 KB |
testcase_09 | AC | 489 ms
65,016 KB |
testcase_10 | AC | 819 ms
63,288 KB |
testcase_11 | AC | 952 ms
63,828 KB |
testcase_12 | AC | 905 ms
64,248 KB |
testcase_13 | AC | 880 ms
63,412 KB |
testcase_14 | AC | 891 ms
62,532 KB |
testcase_15 | AC | 853 ms
64,244 KB |
testcase_16 | AC | 962 ms
63,568 KB |
testcase_17 | AC | 889 ms
63,760 KB |
testcase_18 | AC | 848 ms
63,164 KB |
testcase_19 | AC | 892 ms
62,624 KB |
testcase_20 | AC | 875 ms
63,188 KB |
testcase_21 | AC | 981 ms
63,236 KB |
testcase_22 | AC | 917 ms
64,788 KB |
testcase_23 | AC | 924 ms
63,380 KB |
testcase_24 | AC | 843 ms
63,212 KB |
testcase_25 | AC | 812 ms
64,828 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); int add = sc.nextInt(); Question[] questions = new Question[n]; for (int i = 0; i < n; i++) { questions[i] = new Question(sc.nextInt(), sc.nextInt() - 1); } Arrays.sort(questions); boolean[] used = new boolean[m]; for (int i = 0; i < n; i++) { if (!used[questions[i].type]) { questions[i].value += add; used[questions[i].type] = true; } } Arrays.sort(questions); long[] sums = new long[n + 1]; for (int i = 1; i <= n; i++) { sums[i] = sums[i - 1] + questions[i - 1].value; } int k = sc.nextInt(); long ans = 0; while (k-- > 0) { ans += sums[sc.nextInt()]; } System.out.println(ans); } static class Question implements Comparable<Question> { int value; int type; public Question(int value, int type) { this.value = value; this.type = type; } public int compareTo(Question another) { return another.value - value; } } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }