template <class C, class Pred>
int FindBest(const C& c, int pos, int count, const Pred& pred)
{
===>	if(c.GetCount() == 0)
		return -1;
	typename C::ValueType m = c[pos];
	int mi = pos;
===>	for(int i = pos+1; i < count; i++)
		if(pred(c[i], m)) {
			m = c[i];
			mi = i;
		}
	return mi;
}