#include<bits/stdc++.h>

#define LL long long

#define fi first

#define se second

#define mk make_pair

#define PII pair<int, int>

#define y1 skldjfskldjg

#define y2 skldfjsklejg

using namespace std;

const int N = 1e5 + ;

const int M = 1e7 + ;

const int inf = 0x3f3f3f3f;

const LL INF = 0x3f3f3f3f3f3f3f3f;

const int mod = ;

int n, m, cur, x, up, a[N], f[][ << ], op[], cnt[ << ];

char t[][];

int dp(int x, int s) {

    if(s == up - ) return ;

    if(f[x][s] != inf) return f[x][s];

    f[x][s] = op[x] ==  ? -inf : inf;

    for(int j = ; j < n; j++) {

        if((s >> j) & ) continue;

        int add = t[x][] == 'p' ? a[j] : ;

        if(op[x] == ) f[x][s] = max(f[x][s], dp(x + , s | ( << j)) + add);

        else f[x][s] = min(f[x][s], dp(x + , s | ( << j)) - add);

    }

    return f[x][s];

}

int main() {

    memset(f, inf, sizeof(f));

    scanf("%d", &n);

    for(int i = ; i < n; i++) scanf("%d", &a[i]);

    sort(a, a + n); reverse(a, a + n);

    scanf("%d", &m); n = min(n, m); up =  << n;

    for(int i = ; i < m; i++)

        scanf("%s%d", t[i], &op[i]);

    printf("%d\n", dp(, ));

    return ;

}

/*

*/