Submission #1293290

---

Source Code Expand

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

int main() {
    int na, nb;
    cin >> na >> nb;
    vector<int> a, b;
    for (int i = 0; i < na; ++i) {
        int j;
        cin >> j;
        a.emplace_back(j - 1);
    }
    for (int i = 0; i < nb; ++i) {
        int j;
        cin >> j;
        b.emplace_back(j - 1);
    }
    sort(a.begin(), a.end());
    sort(b.begin(), b.end());
    int x = 0;
    int k = 0;
    for (int i = 0; i < na; ++i) {
        while (a[i] > b[k] && k < nb - 1) {
            ++k;
        }
        if (a[i] == b[k])
            ++x;
    }
    printf("%.9lf\n", x / (double)(na + nb - x));
    return 0;
}

Submission Info

Judge Result