Submission #2714437

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define CK(N, A, B) (A <= N && N < B)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define RREP(i, a, b) for (int i = (b - 1); a <= i; i--)
#define F first
#define S second
typedef long long ll;

const int INF = 1e9 + 7;
const long long LLINF = 1e18;

int n;
int f[101][5][2];
int p[101][11];
int cnt[101];
int main() {
    cin>>n;
    REP(i, 0, n) REP(j, 0, 5) REP(k, 0, 2){
        cin>>f[i][j][k];
        if(f[i][j][k]) cnt[i]++;
    }
    REP(i, 0, n) REP(j, 0, 11){
        cin>>p[i][j];
    }

    int ans=0;
    int mini=INF;
    bool flag=true;
    REP(i, 0, n){
        int mx=-INF;
        int mn=INF;
        REP(j, 0, cnt[i]+1){
            mx=max(mx, p[i][j]);
            if(j!=0) mn=min(mn, p[i][j]);
        }
        if(mx!=p[i][0]) flag=false;
        ans+=mx;
        mini=min(mini, mn-p[i][0]);
    }
    if(flag) cout<<ans+mini<<endl;
    else cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result