Submission #75814960

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

// https://github.com/skrewbar/cp-templates

#define all(v) (v).begin(), (v).end()
#define compress(v) \
    sort(all(v));   \
    v.erase(unique(all(v)), (v).end())
#define by(x) [](const auto& a, const auto& b) { return a.x < b.x; }
#define by_desc(x) [](const auto& a, const auto& b) { return a.x > b.x; }

template <typename T>
using MinHeap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
bool minimize(T& target, T candidate) {
    return target > candidate ? (target = candidate, true) : false;
}
template <typename T>
bool maximize(T& target, T candidate) {
    return target < candidate ? (target = candidate, true) : false;
}

using ll = long long;
ll a[303030];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    ll N, K, M;
    cin >> N >> K >> M;

    for (int i = 1; i <= N; i++)
        cin >> a[i];
    if (M <= N) {
        cout << a[M];
        return 0;
    }
    sort(a + 1, a + N + 1);
        cout << a[K];

    return 0;
}

Submission Info

Judge Result