I never participated in IOI, but at least in ACM contests I have never seen a problem where suboptimal heuristic search was allowed.
Now we're mixing up two criteria. Contest problems are small enough that an optimal solution can be found in reasonable time; but since packing problems usually end up NP complete or NP hard, in the real world you'll end up using heuristics.
It's definitely not rocket science. 15 year old kids have been doing this for years in IOI etc.