Codeforces Round #710 Div3 Solutions
Solutions for all problems in Codeforces Round #710 Div3.…
Solutions for all problems in Codeforces Round #710 Div3.…
Greedy. But the problem is how to prove. First of all, we have two different kinds of people. Type #1, the number of days they can join is not more than...…
Of course greedy. But it's very clear. So more a implementation problem.…
Not hard, But need consider carefully. Still can be kind of game problem.…
Simple Greedy. Pair the points who have smaller absolute value as soon as we can.…