제출 #634422

#제출 시각아이디문제언어결과실행 시간메모리
634422Darren0724Team Contest (JOI22_team)C++17
8 / 100
2063 ms4688 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define all(x) x.begin(),x.end() #define pii pair<int,int> #define rz resize #define pb emplace_back int INF=1e18; int mod=1e9+7; signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); int n;cin>>n; vector<int> a(n),b(n),c(n); for(int i=0;i<n;i++){ cin>>a[i]>>b[i]>>c[i]; } int ans=-1; for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ for(int k=0;k<n;k++){ if(i==j||j==k||i==k){ continue; } if(a[i]<=a[j]||a[i]<=a[k]||b[j]<=b[i]||b[j]<=b[k]||c[k]<=c[i]||c[k]<=c[j]){ continue; } ans=max(ans,a[i]+b[j]+c[k]); } } } cout<<ans<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...