Can somebdy pls help me about how to approach to this problem. http://www.spoj.com/problems/SPEC_SET/
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
Can somebdy pls help me about how to approach to this problem. http://www.spoj.com/problems/SPEC_SET/
| Name |
|---|



When I solved this problem first I wrote a brute-force for small cases to check for a "pattern". If you see the "pattern" then you can come up with a greedy solution. Maybe it will be good idea to train your brute-force skills, nonetheless, here is my brute-force for checking the pattern
http://pastebin.com/qMZ4w0fp