Proof of greedy approach in 241C
Difference between en1 and en2, changed 228 character(s)
Hello cf, according to the [editorial](http://codeforces.com/blog/entry/12277) of [241C](http://codeforces.com/contest/416/problem/C) problem the group which will pay maximum should be assigned to the smallest sized table to which it can fit. Can anybody prove this is optimal strategy?<br>↵
Also the problem has a tag of dp, so how to solve this problem using dp?<br>↵
Any help is highly appreciated.<br>

<br>↵
**Those who are downvoting the post should kindly state why in the comments**. According to me this is a perfectly valid question and I can't understand why are people downvoting it. Let me guess. Yes, they are a**holes.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Ghost0fSparta 2018-10-02 04:53:17 228 Tiny change: 'e a**holes.' -> 'e a**holes'
en1 English Ghost0fSparta 2018-10-01 21:39:49 437 Initial revision (published)