Submission #605211

#TimeUsernameProblemLanguageResultExecution timeMemory
605211MohamedAhmed04Team Contest (JOI22_team)C++14
8 / 100
2080 ms3544 KiB
#include <bits/stdc++.h> using namespace std ; const int MAX = 1e5 + 10 ; int arr[MAX][3] ; int n ; int main() { ios_base::sync_with_stdio(0) ; cin.tie(0) ; cin>>n ; for(int i = 0 ; i < n ; ++i) cin>>arr[i][0]>>arr[i][1]>>arr[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(arr[i][0] > arr[j][0] && arr[i][0] > arr[k][0] && arr[j][1] > arr[i][1] && arr[j][1] > arr[k][1] && arr[k][2] > arr[i][2] && arr[k][2] > arr[j][2]) ans = max(ans , arr[i][0] + arr[j][1] + arr[k][2]) ; } } } return cout<<ans<<"\n" , 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...