Submission #997844


Source Code Expand

import java.io.*;
import java.util.*;
import java.util.function.IntPredicate;


public class Main {
	class Pair{
		int idx;
		int value;
		public Pair(int idx, int value){
			this.idx = idx;
			this.value = value;
		}
	}
	
	int N, M, K;
	Pair[] A;
	public void solve() {
		N = nextInt();
		M = nextInt();
		K = nextInt();
		A = new Pair[N];
		for(int i = 0; i < N; i++){
			A[i] = new Pair(i, nextInt());
		}
		Arrays.sort(A, (a, b) -> Integer.compare(b.value, a.value));
		long ans = 0;
		for(int i = 0; i < K; i++){
			ans += A[i].value;
		}
		out.println(ans);
		
	}
 
	private static PrintWriter out;

	public static void main(String[] args) {
		out = new PrintWriter(System.out);
		new Main().solve();
		out.flush();
	}

	public static int nextInt() {
		int num = 0;
		String str = next();
		boolean minus = false;
		int i = 0;
		if (str.charAt(0) == '-') {
			minus = true;
			i++;
		}
		int len = str.length();
		for (; i < len; i++) {
			char c = str.charAt(i);
			if (!('0' <= c && c <= '9'))
				throw new RuntimeException();
			num = num * 10 + (c - '0');
		}
		return minus ? -num : num;
	}

	public static long nextLong() {
		long num = 0;
		String str = next();
		boolean minus = false;
		int i = 0;
		if (str.charAt(0) == '-') {
			minus = true;
			i++;
		}
		int len = str.length();
		for (; i < len; i++) {
			char c = str.charAt(i);
			if (!('0' <= c && c <= '9'))
				throw new RuntimeException();
			num = num * 10l + (c - '0');
		}
		return minus ? -num : num;
	}

	public static String next() {
		int c;
		while (!isAlNum(c = read())) {
		}
		StringBuilder build = new StringBuilder();
		build.append((char) c);
		while (isAlNum(c = read())) {
			build.append((char) c);
		}
		return build.toString();
	}

	private static byte[] inputBuffer = new byte[1024];
	private static int bufferLength = 0;
	private static int bufferIndex = 0;

	private static int read() {
		if (bufferLength < 0)
			throw new RuntimeException();
		if (bufferIndex >= bufferLength) {
			try {
				bufferLength = System.in.read(inputBuffer);
				bufferIndex = 0;
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
			if (bufferLength <= 0)
				return (bufferLength = -1);
		}
		return inputBuffer[bufferIndex++];
	}

	private static boolean isAlNum(int c) {
		return '!' <= c && c <= '~';
	}
}

Submission Info

Submission Time
Task A - Struck Out
User a3636tako
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 2423 Byte
Status WA
Exec Time 371 ms
Memory 32020 KB

Judge Result

Set Name Sample subtask1 subtask2 subtask3 All
Score / Max Score 0 / 0 0 / 100 0 / 200 0 / 300 0 / 100
Status
WA × 3
WA × 10
WA × 12
WA × 21
WA × 43
Set Name Test Cases
Sample sample_1.txt, sample_2.txt, sample_3.txt
subtask1 sample_2.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
subtask2 sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt
subtask3 sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt
All sample_1.txt, sample_2.txt, sample_3.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt, subtask_4_1.txt, subtask_4_10.txt, subtask_4_11.txt, subtask_4_12.txt, subtask_4_13.txt, subtask_4_2.txt, subtask_4_3.txt, subtask_4_4.txt, subtask_4_5.txt, subtask_4_6.txt, subtask_4_7.txt, subtask_4_8.txt, subtask_4_9.txt
Case Name Status Exec Time Memory
sample_1.txt WA 212 ms 13644 KB
sample_2.txt WA 190 ms 14024 KB
sample_3.txt WA 177 ms 13264 KB
subtask_1_1.txt WA 185 ms 14032 KB
subtask_1_2.txt WA 236 ms 15664 KB
subtask_1_3.txt WA 349 ms 31568 KB
subtask_1_4.txt WA 226 ms 15872 KB
subtask_1_5.txt WA 347 ms 31148 KB
subtask_1_6.txt WA 181 ms 13516 KB
subtask_1_7.txt WA 347 ms 31120 KB
subtask_1_8.txt WA 339 ms 31624 KB
subtask_1_9.txt WA 184 ms 13648 KB
subtask_2_1.txt WA 185 ms 13392 KB
subtask_2_2.txt WA 190 ms 13896 KB
subtask_2_3.txt WA 193 ms 13900 KB
subtask_2_4.txt WA 185 ms 13644 KB
subtask_2_5.txt WA 186 ms 13388 KB
subtask_2_6.txt WA 193 ms 13904 KB
subtask_2_7.txt WA 192 ms 13772 KB
subtask_2_8.txt WA 190 ms 13900 KB
subtask_2_9.txt WA 190 ms 13900 KB
subtask_3_1.txt WA 341 ms 30820 KB
subtask_3_2.txt WA 344 ms 31480 KB
subtask_3_3.txt WA 343 ms 31924 KB
subtask_3_4.txt WA 333 ms 26068 KB
subtask_3_5.txt WA 230 ms 15192 KB
subtask_3_6.txt WA 350 ms 31388 KB
subtask_3_7.txt WA 357 ms 31916 KB
subtask_3_8.txt WA 241 ms 15700 KB
subtask_3_9.txt WA 337 ms 31140 KB
subtask_4_1.txt WA 355 ms 31884 KB
subtask_4_10.txt WA 356 ms 31608 KB
subtask_4_11.txt WA 362 ms 32020 KB
subtask_4_12.txt WA 332 ms 31300 KB
subtask_4_13.txt WA 357 ms 31296 KB
subtask_4_2.txt WA 360 ms 31904 KB
subtask_4_3.txt WA 369 ms 31332 KB
subtask_4_4.txt WA 344 ms 31256 KB
subtask_4_5.txt WA 371 ms 30856 KB
subtask_4_6.txt WA 340 ms 31712 KB
subtask_4_7.txt WA 344 ms 31416 KB
subtask_4_8.txt WA 330 ms 31244 KB
subtask_4_9.txt WA 343 ms 31388 KB