World Robot Contest2025-2026Algorithm Application ThemeJunior Highwrc.hao.work
WRC
Contest Archive / Structured Dossiers青少年算法应用训练档案馆

把训练题、知识点、执行证据和最终解题档案统一归档成可直接浏览的竞赛资料库。

Archive30 Cases

四大文化赛道完整展开

AccessHTTPS

完整题面 / 题解 / 运行证据

No Rounded CornersTailwind FirstDossier Ready
02-solution/src/python/main.py

main.py

站内文件视图直接读取仓库内容,Markdown 使用文档排版渲染,其余文本文件保持原始排版,方便校对训练证据链。

文件类型.py

10-cases/s1-jh-08-heritage-transport-packing/02-solution/src/python/main.py

import sys


def solve(data: str) -> str:
    tokens = list(map(int, data.split()))
    if not tokens:
        return ""
    it = iter(tokens)
    n = next(it)
    limit = next(it)
    weights = sorted(next(it) for _ in range(n))
    left = 0
    right = n - 1
    boxes = 0
    single_boxes = 0
    max_pair = 0
    while left <= right:
        boxes += 1
        if left == right:
            single_boxes += 1
            break
        if weights[left] + weights[right] <= limit:
            pair_weight = weights[left] + weights[right]
            if pair_weight > max_pair:
                max_pair = pair_weight
            left += 1
            right -= 1
        else:
            single_boxes += 1
            right -= 1
    return "\n".join(
        [
            f"boxes={boxes}",
            f"single_boxes={single_boxes}",
            f"max_pair={max_pair}",
        ]
    )


if __name__ == "__main__":
    sys.stdout.write(solve(sys.stdin.read()).strip())
    sys.stdout.write("\n")