#include <bits/stdc++.h>
using namespace std;
void solve(long long N, std::vector<long long> A, long long Q,
           std::vector<long long> B, std::vector<long long> C) {
  multiset<int> D;
  for (int i = 0; i < N; i++) {
    D.insert(A[i]);
  }
  for (int i = 0; i < Q; i++) {
    int count = D.erase(B[i]);
    for (int j = 0; j < count; j++) {
      D.insert(C[i]);
    }
    long long sum = 0;
    for (auto it = D.begin(); it != D.end(); it++) {
      sum += *it;
    }
    cout << sum << endl;
  }
}
int main() {
  long long N;
  scanf("%lld", &N);
  std::vector<long long> A(N);
  for (int i = 0; i < N; i++) {
    scanf("%lld", &A[i]);
  }
  long long Q;
  scanf("%lld", &Q);
  std::vector<long long> B(Q);
  std::vector<long long> C(Q);
  for (int i = 0; i < Q; i++) {
    scanf("%lld", &B[i]);
    scanf("%lld", &C[i]);
  }
  solve(N, std::move(A), Q, std::move(B), std::move(C));
  return 0;
}
