Falling Ants

直接按照题目意思求

#include <iostream>using namespace std;#include <stdio.h>int main(){      int n;    cin >> n;    while(n != 0){          int l, w, h, maxs=0, maxh=0;          for(int i = 1; i <= n;i++){            cin >> l >> w >> h;            if(h > maxh){                maxh = h;                maxs = l*w;            }              if(h == maxh && l*w > maxs) maxs=l*w;          }          cout << maxs*maxh << endl;          cin >> n;    }  }