Submission #75814942

Source Code Expand

#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#define int long long
using namespace std;

array<int, 303030> A;
int N, K, M;

signed main() {
	cin.tie(0)->sync_with_stdio(0);

	cin >> N >> K >> M;

	for (int i = 1; i <= N; i++) {
		cin >> A[i];
	}

	if (M <= N) {
		cout << A[M] << '\n';

		return 0;
	}

	sort(A.begin() + 1, A.begin() + N + 1);

	cout << A[K] << '\n';

	return 0;
}

Submission Info

Submission Time
Task F - The Kth Smallest Number
User fortunatly
Language C++23 (GCC 15.2.0)
Score 100
Code Size 433 Byte
Status AC
Exec Time 32 ms
Memory 6024 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status AC
AC × 27
Set Name Test Cases
Sample
All 01-001.txt, 01-002.txt, 01-003.txt, 01-004.txt, 01-005.txt, 01-006.txt, 01-007.txt, 01-008.txt, 01-009.txt, 01-010.txt, 01-011.txt, 01-012.txt, 01-013.txt, 01-014.txt, 01-015.txt, 01-016.txt, 01-017.txt, 01-018.txt, 01-019.txt, 01-020.txt, 01-021.txt, 01-022.txt, 01-023.txt, 01-024.txt, 01-025.txt, 01-026.txt, 01-027.txt
Case Name Status Exec Time Memory
01-001.txt AC 2 ms 3420 KiB
01-002.txt AC 1 ms 3420 KiB
01-003.txt AC 1 ms 3324 KiB
01-004.txt AC 1 ms 3468 KiB
01-005.txt AC 1 ms 3552 KiB
01-006.txt AC 1 ms 3384 KiB
01-007.txt AC 1 ms 3352 KiB
01-008.txt AC 1 ms 3520 KiB
01-009.txt AC 1 ms 3560 KiB
01-010.txt AC 1 ms 3540 KiB
01-011.txt AC 1 ms 3376 KiB
01-012.txt AC 1 ms 3404 KiB
01-013.txt AC 15 ms 5864 KiB
01-014.txt AC 15 ms 5796 KiB
01-015.txt AC 32 ms 5780 KiB
01-016.txt AC 32 ms 6024 KiB
01-017.txt AC 19 ms 4824 KiB
01-018.txt AC 17 ms 4784 KiB
01-019.txt AC 30 ms 5540 KiB
01-020.txt AC 32 ms 5792 KiB
01-021.txt AC 16 ms 6024 KiB
01-022.txt AC 15 ms 5936 KiB
01-023.txt AC 12 ms 5972 KiB
01-024.txt AC 28 ms 5864 KiB
01-025.txt AC 10 ms 5936 KiB
01-026.txt AC 15 ms 5828 KiB
01-027.txt AC 11 ms 5928 KiB