HDU 5162 (water problem)

Topic Links:

http://acm.hdu.edu.cn/showproblem.php?pid=5162

The puzzle: Read for a while to think that the test case was written incorrectly. Play word games with this question. It asks if the current name I is the first in the original array.

#include <stdio.h>#include<iostream>#include<string.h>#include<stdlib.h>#include<math.h>#include<algorithm>#include<queue>using namespacestd;structkid{intId,v;} kid[Ten];inta[Ten];intCMP (Kid a,kid b) {returnA.v>B.V;}intMain () {inttcase; scanf ("%d",&tcase); intt =1;  while(tcase--){        intN; scanf ("%d",&N);  for(intI=1; i<=n;i++){            intA,b,c; scanf ("%d%d%d",&a,&b,&c); KID[I].V=Max (A,max (b,c)); Kid[i].id=i; } sort (Kid+1, kid+1+n,cmp);  for(intI=1; i<=n;i++) {A[kid[i].id]=i; }         for(intI=1; i<n;i++) {printf ("%d", A[i]); } printf ("%d\n", A[n]); }    return 0;}

HDU 5162 (water problem)