#include <bits/stdc++.h>
const int mod = 1e9 + 7;
const int maxn = 1 << 22;
const double eps = 1e-6;
using namespace std;
bool eq(const double &a, const double &b) { return fabs(a - b) < eps; }
bool ls(const double &a, const double &b) { return a + eps < b; }
bool le(const double &a, const double &b) { return eq(a, b) || ls(a, b); }
long long gcd(long long a, long long b) { return a == 0 ? b : gcd(b % a, a); };
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long kpow(long long a, long long b) {
  long long res = 1;
  a %= mod;
  if (b < 0) return 1;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int n, m;
char s[52];
int bitcnt(int x) { return x ? (x & 1) + bitcnt(x >> 1) : 0; }
int v[125], t[125], op[125];
int dp[maxn] = {0};
bool cmp(int a, int b) { return a > b; }
int main() {
  scanf("%d", &n);
  for (int i = 0; i < (n); ++i) scanf("%d", v + i);
  sort(v, v + n, cmp);
  scanf("%d", &m);
  for (int i = m; i >= (1); --i) {
    scanf("%s%d", s, t + i);
    op[i] = (s[0] == 'p');
  }
  dp[0] = 0;
  for (int i = 1; i < ((1 << m)); ++i) {
    int opp = bitcnt(i);
    if (t[opp] == 1) {
      dp[i] = -0x3f3f3f3f;
      for (int j = 0; j < (m); ++j) {
        if (i & (1 << j)) {
          dp[i] = max(dp[i], dp[i ^ (1 << j)] + op[opp] * v[j]);
        }
      }
    } else {
      dp[i] = 0x3f3f3f3f;
      for (int j = 0; j < (m); ++j) {
        if (i & (1 << j)) {
          dp[i] = min(dp[i], dp[i ^ (1 << j)] - op[opp] * v[j]);
        }
      }
    }
  }
  printf("%d\n", dp[(1 << m) - 1]);
  return 0;
}
