input: Write a Python function named `calculate_max_reward` that takes a list of integers `rewardValues` as input and returns the maximum total reward that can be collected. The function should consider the following operations: start with an initial reward of 0 and unmarked indices. Select an unmarked index from the range [0, n-1] and add its value to the total reward if it is greater than the current total, then mark the index. Optimize the operations to maximize the total reward.
  
  Example:
  >>> rewardValues = [1, 2, 4, 3]
  >>> calculate_max_reward(rewardValues)
  10
  
  >>> rewardValues = [7, 1, 5, 9, 2]
  >>> calculate_max_reward(rewardValues)
  24
  
  Constraints:
  1 <= len(rewardValues) <= 2000
  1 <= rewardValues[i] <= 2000
output: def calculate_max_reward(rewardValues):
      rewardValues.sort(reverse=True)
      total_reward = 0
      for value in rewardValues:
          if value > total_reward:
              total_reward += value
      return total_reward