제출 #917485

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
917485		manishjha91	Team Contest (JOI22_team)	C++17	8 / 100	2103 ms	2140 KiB

team

#include<bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using lld = long double;

void solve()
{
	int n;
	cin >> n;

	vector<array<int,3>> a(n);
	for (int i = 0; i < n; i++)
	{
		cin >> a[i][0]>>a[i][1]>>a[i][2];
	}
	
	sort(a.begin(),a.end());
	
	int ans = -1;
	for(int i=0; i<n; i++)
	{
		for(int j=i+1; j<n; j++)
		{
			for(int k=j+1; k<n; k++)
			{
				if(a[k][1]>=max(a[i][1],a[j][1])) continue;
				if(a[k][2]>=max(a[i][2],a[j][2])) continue;
				if(a[k][0]==max(a[i][0],a[j][0])) continue;
				if(a[i][1]>a[j][1] && a[i][2]<a[j][2])
				{
					ans = max(ans, a[k][0] + a[i][1] + a[j][2]);
				}
				else if(a[i][1]<a[j][1] && a[i][2]>a[j][2])
				{
					ans = max(ans, a[k][0] + a[j][1] + a[i][2]);
				}
				
			}
		}
	}
	
	cout<<ans<<"\n";
	
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);

// #ifndef ONLINE_JUDGE
// 	freopen("error.txt", "w", stderr);
// #endif

	int tt = 1;
	// cin >> tt;
	while (tt--)
	{
		solve();
	}
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 27