Submission #2997828

---

Source Code Expand

#include <iostream>
#include <map>
using namespace std;
typedef long long ll;
ll n, k, a[30010], b[30010];
map<ll, ll> mp;
int main(void){
    // Your code here!
    cin >> n >> k;
    for (ll i = 0; i < n; i++) cin >> a[i];
    for (ll i = 0; i < n; i++) cin >> b[i];
    for (ll i = 0; i < n; i++) {
        for (ll j = 0; j < n; j++) {
            mp[a[i] * b[j]]++;
        }
    }
    for (auto itr = mp.begin(); itr != mp.end(); ++itr){
        k -= itr->second;
        if (k <= 0) {
            cout << itr->first << endl;
            break;
        }
    }
}

Submission Info

Judge Result