Submission #46454001

---

Source Code Expand

#include <bits/stdc++.h>

void solve(std::istream& is, std::ostream& os) {
    using Num = long long int;
    Num n {0};
    is >> n;

    std::vector<Num> aset(n);
    std::vector<Num> bset(n);
    std::vector<Num> cset(n);

    for(auto&& a : aset) {
        is >> a;
    }
    std::sort(aset.begin(), aset.end());

    for(auto&& b : bset) {
        is >> b;
    }
    std::sort(bset.begin(), bset.end());

    for(auto&& c : cset) {
        is >> c;
    }
    std::sort(cset.begin(), cset.end());

    Num total {0};
    Num index_a {0};
    Num index_b {0};
    Num index_c {0};
    Num stop {false};
    while(!stop) {
        while ((aset.at(index_a) < bset.at(index_b)) && (bset.at(index_b) < cset.at(index_c))) {
            ++total;
            ++index_a;
            ++index_b;
            ++index_c;

            if ((index_a >= n) || (index_b >= n) || (index_c >= n)) {
                stop = true;
                break;
            }
        }

        if (stop) {
            break;
        }

        while (aset.at(index_a) >= bset.at(index_b)) {
            ++index_b;
            if (index_b >= n) {
                stop = true;
                break;
            }
        }

        if (stop) {
            break;
        }

        while (bset.at(index_b) >= cset.at(index_c)) {
            ++index_c;
            if (index_c >= n) {
                stop = true;
                break;
            }
        }

        if (stop) {
            break;
        }
    }

    os << total << "\n";
    return;
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result