nyoj-精挑细选

#include <iostream>
#include <cstring>

using namespace std;
const int C = 1010;

int a[C];
int b[C];
int c[C];
int sign[C]; 
int Max = 0;
int Maxc = 0;
int Min = 1000000000;

int main()
{
    int n;
    cin >> n;
    int m;
    while(n--)
    {
              Max = 0;
              Maxc = 0;
               Min = 1000000000;
              memset(sign,0,sizeof(sign));
              cin >> m;   
              for(int i = 0 ; i < m ;i ++)
                cin >> a[i] >> b[i] >> c[i];
              for(int i = 0; i < m; i++)
                if(a[i] > Max)
                     Max = a[i];
              for(int i = 0; i < m; i++)
                if(a[i] == Max)
                        sign[i] = 1;
               for(int i = 0; i < m; i++)
                 if(sign[i]&&b[i] < Min)
                     Min = b[i];
              for(int i = 0;  i < m ; i++)
                 if(sign[i]&& b[i] != Min)
                         sign[i] = 0;
              for(int i = 0; i < m; i++)
                if(sign[i]&& c[i] > Maxc)
                   Maxc = c[i];
              cout << Maxc << endl;
    }
              return 0;
              
}

 
#include<stdio.h>
int main()
{
    int n,m,i,a,b,c,x,y,z;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d",&m);
        a=0;b=0;c=0;
        for(i=0;i<m;i++)
        {
            scanf("%d%d%d",&x,&y,&z);
            if(x>a||x==a&&y<b||x==a&&y==b&&z>c) { a=x;b=y;c=z; }
        }
        printf("%d\n",c);
    }
    return 0;
}