Is there a faster way of implementing this 'ranking' algorithm?

Question

Lets Suppose I have an array of arrays, where each sub array represents a ranking i.e

std::array, 3> rankings = {
  { &quo