Today I have done leetcode's December LeetCoding Challenge with cpp.

December LeetCoding Challenge 27

Description

Best Sightseeing Pair

You are given an integer array values where values[i] represents the value of the ith sightseeing spot. Two sightseeing spots i and j have a distance j - i between them.

The score of a pair (i < j) of sightseeing spots is values[i] + values[j] + i - j: the sum of the values of the sightseeing spots, minus the distance between them.

Return the maximum score of a pair of sightseeing spots.

Example 1:

Input: values = [8,1,5,2,6]
Output: 11
Explanation: i = 0, j = 2, values[i] + values[j] + i - j = 8 + 5 + 0 - 2 = 11

Example 2:

Input: values = [1,2]
Output: 2

Constraints:

• 2 <= values.length <= 5 * 104
• 1 <= values[i] <= 1000

Solution

class Solution {
public:
  int maxScoreSightseeingPair(vector<int>& values) {
    priority_queue<int> pq;
    int distance = 0;
    int answer = 0;
    pq.push(-1000);
    for(auto v : values) {
      answer = max(answer, v + pq.top() - distance);
      pq.push(v + distance);
      distance += 1;
    }
    return answer;
  }
};

Accepted
55/55 cases passed (4 ms)
Your runtime beats 23.39 % of cpp submissions
Your memory usage beats 7.51 % of cpp submissions (49.7 MB)