Tmmaster's blog

I can't solve the problem
By Tmmaster, history, 2 years ago, In English

Hello Codeforces! I've been struggling with this problem for half an hour, I've been testing it but I couldn't find the wrong one. Can you help me? UPD: I solved the problem,Thanks. Reason: I couldn't get all the positive numbers.

  • Vote: I like it
  • -3
  • Vote: I do not like it

Comments Comments (2)
| Write comment?
»
2 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Though I really can't understand what you are trying to do but may be you are thinking too much.

  • if its a bonus card store it somewhere.

  • if its a hero card pick the max bonus card and give it to hero and discard that card.

The main vision of the problem is make sure you know how to pick max element of a deck(List) in most suitable time complexity. Just think of a data structure that does the job.

→ Reply
»
2 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Your code gives the wrong answer for the following test case:

7
3 3 3 0 0 1 0

Instead of doing what you're doing, it'd be simpler to simply maintain a priority queue / multiset of all elements and remove the largest one everytime you encounter a hero. Like this.

→ Reply