【題解】APCS1071027-1 王牌投手

#include <iostream>
#include <algorithm>
using namespace std;

bool cmp(int a, int b){
    return a > b;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, rank, a[11];
    cin >> n;
    int sum = 0, cnt = 0;
    for (int i=0; i<n; i++){
        cin >> rank;
        a[0] = 0;
        for (int j=1; j<=10; j++){
            cin >> a[j];
        }
        int cur = a[rank];
        sum += cur;
        sort(a, a+11, cmp);
        if (cur == a[0]) cnt++;
    }
    cout << sum << '\n';
    cout << cnt << '\n';
    return 0;
}

n = int(input())
Sum = 0
cnt = 0
for i in range(n):
    a = list(map(int, input().split()))
    cur = a[a[0]]
    Sum += cur
    a.pop(0)
    a.sort()
    if cur == a[-1]:
        cnt += 1

print(Sum)
print(cnt)