#include using namespace std; #define _p(...) (void)printf(__VA_ARGS__) #define forr(x,arr) for(auto&& x:arr) #define _overload3(_1,_2,_3,name,...) name #define _rep2(i,n) _rep3(i,0,n) #define _rep3(i,a,b) for(int i=int(a);i=int(a);i--) #define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define bit(n) (1LL<<(n)) #define sz(x) ((int)(x).size()) #define fst first #define snd second using ll=long long;using pii=pair;using vb=vector; using vi=vector;using vvi=vector;using vvvi=vector; using vl=vector;using vvl=vector;using vvvl=vector; using vd=vector;using vvd=vector;using vvvd=vector; using vpii=vector;using vvpii=vector;using vvvpii=vector; template T read() {T t; cin >> t; return t;} int score(int star, int k) { return 50 * star + 50 * star / (0.8 + 0.2 * k); } int pi(string p) { return p[0] - 'A'; } void Main() { int n = read(); vector L(n); rep(i, n) L[i] = read(); vi succ_cnt(n); int t = read(); map> table; map total; rep(i, t) { string name = read(); string pstr = read(); int p = pi(pstr); int k = ++succ_cnt[p]; int s = score(L[p], k); table[name][p] = s; total[name].first -= s; total[name].snd = i; } vector> sorter; forr(nsi, total) { sorter.push_back({nsi.snd, nsi.fst}); } sort(all(sorter)); rep(i, sz(sorter)) { cout << (i + 1) << ' '; string name = sorter[i].snd; cout << name << ' '; rep(j, n) { cout << table[name][j] << ' '; } cout << -total[name].fst << endl; } } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }