제출 #887498

#제출 시각아이디문제언어결과실행 시간메모리
887498MinaRagy06Team Contest (JOI22_team)C++17
8 / 100
2090 ms2140 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long int main() { ios_base::sync_with_stdio(0), cin.tie(0); int n; cin >> n; array<int, 3> a[n]; for (int i = 0; i < n; i++) { cin >> a[i][0] >> a[i][1] >> a[i][2]; } 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 (a[i][0] > a[j][0] && a[i][0] > a[k][0] && a[j][1] > a[i][1] && a[j][1] > a[k][1] && a[k][2] > a[i][2] && a[k][2] > a[j][2]) { ans = max(ans, a[i][0] + a[j][1] + a[k][2]); } } } } cout << ans << '\n'; 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...