TopCoder SRM 146 Division 2 250 pts Since you need to calculate the sum of repeated values it seemed natural to me to use a hash table (map) to store the respective sums. Once you have that sum stored you just need to return the highest sum with a simple max algorithm.

SRM_146_Div2_250.cpp

#include <vector>
#include <map>

using namespace std;

class YahtzeeScore {
 public:
  int maxPoints(vector<int> toss) {
    map<int, int> sum;
    
    for(auto p : toss) {
      sum[p] += p;
    }
    
    int max = 0;
    for(auto p : sum) {
      max = p.second > max ? p.second : max;
    }
    
    return max;
  }
};