Submission #48776077

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;
}

void solve(std::istream& is, std::ostream& os) {
    Num n, q;
    is >> n >> q;

    Vec rs(n);
    for(auto&& x : rs) {
        is >> x;
    }
    std::ranges::sort(rs);

    Vec cumsum{0};
    for(const auto& r : rs) {
        cumsum.push_back(cumsum.back() + r);
    }

    while(q-- > 0) {
        Num x;
        is >> x;
        auto it = std::lower_bound(cumsum.begin(), cumsum.end(), x);
        if ((it != cumsum.begin()) && (*it != x)) {
            --it;
        }
        auto d = it - cumsum.begin();
        os << d << "\n";
    }
}

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

Submission Info

Judge Result