Submission #48120171

---

Source Code Expand

import bisect
import sys
from typing import List

sys.setrecursionlimit(210000)


def eprint(*args, **kwargs):
    print(
        '[EPRINT]',
        *args, file=sys.stderr, **kwargs)


def main() -> None:
    input()
    values = list(map(int, input().split()))
    s_values = sorted(values)
    a_values = [0] * (len(values) + 1)
    outputs: List[int] = []

    for i, v in enumerate(s_values[::-1]):
        a_values[len(values) - i - 1] = a_values[len(values) - i] + v

    for v in values:
        outputs.append(a_values[bisect.bisect_right(s_values, v)])

    print(' '.join(str(v) for v in outputs))


if __name__ == '__main__':
    main()

Submission Info

Judge Result