Submission #75815791

Source Code Expand

#include <bits/stdc++.h>
#define fastio cin.tie(0)->sync_with_stdio(0)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define sz(x) (int)(x).size()
using namespace std;
typedef long long ll;

int main() {
    fastio; ll N, K, M; cin >> N >> K >> M;
    vector<int> v(N);
    for (auto &i : v) cin >> i;
    if (M <= N) cout << v[M-1] << "\n";
    else {
        sort(all(v));
        cout << v[K-1] << "\n";
    }
    return 0;
}

Submission Info

Submission Time
Task F - The Kth Smallest Number
User Lov34ever
Language C++23 (GCC 15.2.0)
Score 100
Code Size 545 Byte
Status AC
Exec Time 33 ms
Memory 4708 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 1 ms 3536 KiB
01-002.txt AC 1 ms 3548 KiB
01-003.txt AC 1 ms 3632 KiB
01-004.txt AC 1 ms 3664 KiB
01-005.txt AC 1 ms 3488 KiB
01-006.txt AC 1 ms 3640 KiB
01-007.txt AC 1 ms 3632 KiB
01-008.txt AC 1 ms 3572 KiB
01-009.txt AC 1 ms 3684 KiB
01-010.txt AC 1 ms 3572 KiB
01-011.txt AC 1 ms 3548 KiB
01-012.txt AC 1 ms 3584 KiB
01-013.txt AC 15 ms 4648 KiB
01-014.txt AC 15 ms 4628 KiB
01-015.txt AC 33 ms 4648 KiB
01-016.txt AC 33 ms 4700 KiB
01-017.txt AC 20 ms 4104 KiB
01-018.txt AC 18 ms 3900 KiB
01-019.txt AC 30 ms 4484 KiB
01-020.txt AC 33 ms 4540 KiB
01-021.txt AC 15 ms 4568 KiB
01-022.txt AC 14 ms 4540 KiB
01-023.txt AC 12 ms 4600 KiB
01-024.txt AC 29 ms 4704 KiB
01-025.txt AC 9 ms 4700 KiB
01-026.txt AC 15 ms 4708 KiB
01-027.txt AC 11 ms 4568 KiB