#include using namespace std; typedef long long ll; #define F first #define S second #define pii pair #define eb emplace_back #define all(v) v.begin(), v.end() #define rep(i, n) for (int i = 0; i < n; ++i) #define rep3(i, l, n) for (int i = l; i < n; ++i) #define chmax(a, b) a = (a >= b ? a : b) #define chmin(a, b) a = (a <= b ? a : b) #define out(a) cout << a << endl #define outa(a, n) rep(_, n) cout << a[_] << " "; cout << endl #define SZ(v) (int)v.size() #define inf (int)(1e9+7) #define abs(x) (x >= 0 ? x : -(x)) #define ceil(a, b) a / b + !!(a % b) #define FIX(a) fixed << setprecision(a) bool comp(pair a, pair b) { if (a.F != b.F) return a.F > b.F; return a.S < b.S; } int main() { map mp; int n; cin >> n; rep(i, n) { int no; cin >> no; int m, s; cin >> m >> s; rep(i, m) { string str; cin >> str; mp[str] += s; } } vector > v; for (auto e : mp) { v.eb(make_pair(e.S, e.F)); } sort(all(v), comp); rep(i, SZ(v)) cout << v[i].S << " " << v[i].F << endl; }