Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Solve Problem 2558. Take Gifts From the Richest Pile #2260

Open
wants to merge 2 commits into
base: main
Choose a base branch
from
+52 −0

feat(problem-2558/cpp): solve by using `std::priority_queue`

f095150
Select commit
Loading
Failed to load commit list.
Sign in for the full log view
Open

Solve Problem 2558. Take Gifts From the Richest Pile #2260

feat(problem-2558/cpp): solve by using `std::priority_queue`
f095150
Select commit
Loading
Failed to load commit list.

Annotations

1 warning
Test Old Solutions
succeeded Dec 19, 2024 in 6m 34s