Finding the first best candidate that is better than benchmark set .
for ( int i = sample_size ; i < n ; i ++ ) if ( candidate [ i ] >= candidate [ best ] ) { best = i ; break ; } if ( best >= sample_size ) cout << endl << " Best ▁ candidate ▁ found ▁ is ▁ " << best + 1 << " ▁ with ▁ talent ▁ " << candidate [ best ] << endl ; else cout << " Couldn ' t ▁ find ▁ a ▁ best ▁ candidate STRNEWLINE " ; }