Skip to content

3080. Mark Elements on Array by Performing Queries 👍

  • Time: $O(n\log n + m\log n)$
  • Space: $O(n)$
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
class Solution {
 public:
  vector<long long> unmarkedSumArray(vector<int>& nums,
                                     vector<vector<int>>& queries) {
    vector<long long> ans;
    vector<bool> marked(nums.size());
    long sum = accumulate(nums.begin(), nums.end(), 0L);
    using P = pair<int, int>;  // (nums[i], i)
    priority_queue<P, vector<P>, greater<>> minHeap;

    for (int i = 0; i < nums.size(); ++i)
      minHeap.emplace(nums[i], i);

    for (const vector<int>& query : queries) {
      const int index = query[0];
      const int k = query[1];
      if (!marked[index]) {
        marked[index] = true;
        sum -= nums[index];
      }
      for (int popped = 0; popped < k && !minHeap.empty();) {
        const auto [num, i] = minHeap.top();
        minHeap.pop();
        if (!marked[i]) {
          marked[i] = true;
          sum -= num;
          ++popped;
        }
      }
      ans.push_back(sum);
    }

    return ans;
  }
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
class Solution {
  public long[] unmarkedSumArray(int[] nums, int[][] queries) {
    long[] ans = new long[queries.length];
    boolean[] marked = new boolean[nums.length];
    long sum = Arrays.stream(nums).asLongStream().sum();
    // (nums[i], i)
    Queue<Pair<Integer, Integer>> minHeap = new PriorityQueue<>(
        (a, b)
            -> a.getKey().equals(b.getKey()) ? a.getValue().compareTo(b.getValue())
                                             : a.getKey().compareTo(b.getKey()));

    for (int i = 0; i < nums.length; ++i)
      minHeap.offer(new Pair<>(nums[i], i));

    for (int queryIndex = 0; queryIndex < queries.length; ++queryIndex) {
      final int index = queries[queryIndex][0];
      final int k = queries[queryIndex][1];
      if (!marked[index]) {
        marked[index] = true;
        sum -= nums[index];
      }
      for (int popped = 0; popped < k && !minHeap.isEmpty();) {
        final int num = minHeap.peek().getKey();
        final int i = minHeap.poll().getValue();
        if (!marked[i]) {
          marked[i] = true;
          sum -= num;
          ++popped;
        }
      }
      ans[queryIndex] = sum;
    }

    return ans;
  }
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
class Solution:
  def unmarkedSumArray(
      self,
      nums: list[int],
      queries: list[list[int]],
  ) -> list[int]:
    ans = []
    marked = set()
    summ = sum(nums)
    minHeap = [(num, i) for i, num in enumerate(nums)]
    heapq.heapify(minHeap)

    for index, k in queries:
      if index not in marked:
        marked.add(index)
        summ -= nums[index]
      popped = 0
      while popped < k and minHeap:
        num, i = heapq.heappop(minHeap)
        if i not in marked:
          marked.add(i)
          summ -= num
          popped += 1
      ans.append(summ)

    return ans