제출 #933787

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
933787		velislavgarkov	Team Contest (JOI22_team)	C++14	0 / 100	3 ms	4536 KiB

team

#include <iostream>
#include <algorithm>
using namespace std;
struct Player {
    long long a;
    int ind;
    bool friend operator < (Player x, Player y) {
        return x.a<y.a;
    }
};
const int MAXN=1e5+5e4+10;
Player x[MAXN], y[MAXN], z[MAXN];
bool used[MAXN];
int main ()  {
    int n;
    cin >> n;
    for (int i=0;i<n;i++) {
        cin >> x[i].a >> y[i].a >> z[i].a;
        x[i].ind=y[i].ind=z[i].ind=i;
    }
    sort(x,x+n);
    sort(y,y+n);
    sort(z,z+n);
    int ix, iy, iz;
    ix=iy=iz=n-1;
    while (ix>=0 && iy>=0 && iz>=0) {
        if (used[x[ix].ind]) {
            ix--;
            continue;
        }
        if (used[y[iy].ind]) {
            iy--;
            continue;
        }
        if (used[z[iz].ind]) {
            iz--;
            continue;
        }
        if (x[ix].ind==y[iy].ind || x[ix].ind==z[iz].ind) {
            used[x[ix].ind]=true;
            ix--;
            continue;
        }
        if (y[iy].ind==z[iz].ind) {
            used[y[iy].ind]=true;
            iy--;
            continue;
        }
        cout << x[ix].a+y[iy].a+z[iz].a << endl;
        return 0;
    }
    cout << -1 << endl;
}

• Subtask 1: 0 / 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