Variation of #381 Problem G (Petya's Exams)
Difference between en2 and en3, changed 0 character(s)
I am trying to solve a slight variation of [Problem G (Petya's Exams) in Contest #481](http://codeforces.net/contest/978/problem/G). The original problem asks us to find out if Petya can complete *ALL* exams. This can be solved with a greedy approach as described in the [tutorial](http://codeforces.net/blog/entry/59430). ↵
Now, what if we are asked to maximize the number of exams Petya can complete. To summarize, Given details of all exams and exam dates, how do we find out the maximum number of exams Petya can write.↵
↵
Any pointers to solve this problem would be really helpful. 

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English bird-man2 2018-05-14 09:15:52 0 (published)
en4 English bird-man2 2018-05-14 09:03:06 2 (saved to drafts)
en3 English bird-man2 2018-05-14 05:44:43 0 (published)
en2 English bird-man2 2018-05-14 05:44:25 29
en1 English bird-man2 2018-05-14 05:43:47 619 Initial revision (saved to drafts)