提出 #67003350

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
namespace mlp = boost::multiprecision;
using bint = mlp::cpp_int;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using mint = modint998244353;
#define rep(i,n) for (int i=0;i<(int)(n);i++)
#define rep1(i,n) for (int i=1;i<(int)(n);i++)
#define rrep(i,n) for (ll i=n-1;i>=0;i--)
#define rrep1(i,n) for (ll i=n-1;i>0;i--)
#define chmax(a,b) a=max(a,b)
#define chmin(a,b) a=min(a,b)
#define pi 3.141592653589793238

//対オーバーフロー兵器
//#define int long long


signed main(){
  cin.tie(nullptr);
  ios::sync_with_stdio(false);

  int T; cin>>T;
  rep(t,T){
    int N; cin>>N;
    vector<vector<int> > A(N,vector<int>(3));
    rep(i,N)rep(j,3) cin>>A[i][j];

    ll sum=0;
    rep(i,N) sum+=min(A[i][0]+A[i][2],A[i][1]);

    ll a=0,b=0;
    rep(i,N) a+=min(A[i][0],A[i][1]);
    rep(i,N) b+=min(A[i][1],A[i][2]);

    cout<<min({a,b,sum/2})<<endl;
  }

  return 0;
}

提出情報

ジャッジ結果