提出 #48118806

---

ソースコード 拡げる

#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 {0};
    is >> n;

    Vec aset(n);
    for(auto&& x : aset) {
        is >> x;
    }

    auto ss = aset;
    std::ranges::sort(ss);
    Vec cumsum {0};
    for(const auto& x : ss) {
        cumsum.push_back(cumsum.back() + x);
    }

    const Num sum = cumsum.back();

    for(Num i{0}; i<n; ++i) {
        const auto a = aset.at(i);
        auto d = std::upper_bound(ss.begin(), ss.end(), a) - ss.begin();
        auto ans = sum - cumsum.at(d);
        os << ans;
        if ((i + 1) == n) {
            os << "\n";
        } else {
            os << " ";
        }
    }
}

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

提出情報

ジャッジ結果