263B - Squares - CodeForces Solution

/*
 * Handle: ZaphkielX
 * Date: 15-03-2023
 */
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

using vi = vector<int>;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, k;
    cin >> n >> k;
    if (k > n) {
        cout << "-1";
    }
    else if (k == n) {
        cout << "0 0";
    }
    else {
        ll arr[n];
        for (int i = 0; i < n; i++) {
            cin >> arr[i];
        }
        sort(arr, arr+n);
        for (int i = 0; i < n; i++) {
            if (i == k) {
                cout << arr[n - i] << " " << arr[n - i];
                break;
           }
        }
    }
    return 0;
}