sicily 1063. Who's the Boss 排序+递推

 #include <cstdio>
 #include <algorithm>
 using namespace std;
 struct Emp{
     int id, salary, height, boss, sub;
     Emp(int i=, int s=, int h=, int b=, int sb=) :
             id(i), salary(s), height(h), boss(b), sub(sb) {}
 } emp[];
 bool cmp(Emp a, Emp b) {
     return a.salary < b.salary;
 }
 int main() {
     int t;
     scanf("%d", &t);
     while (t--) {
         int m, q;
         scanf("%d%d", &m, &q);
         for (int i = ; i < m; i++) {
             int id, sal, hei;
             scanf("%d%d%d", &id, &sal, &hei);
             emp[i] = Emp(id, sal, hei); // Boss id 与 subordinate 默认为 0
         }
         // 按薪水升序排序
         sort(emp, emp+m, cmp);
         // 找直属上司，计算下属数量
         for (int i = ; i < m-; i++) {
             // 直属上司在数组中对应的下标 boss
             int boss = -;
             for (int j = i+; j < m; j++)
               if (emp[j].height >= emp[i].height) {
                   boss = j;
                   break;
               }
             if (boss != -) {
                 emp[i].boss = emp[boss].id;
                 emp[boss].sub += emp[i].sub + ;
             }
         }
         for (int i = ; i < q; i++) {
             int query;
             scanf("%d", &query);
             int j, index = m-;
             for (j = ; j < m; j++)  // 找到要查询的对象对应的下标 index
                 if (emp[j].id == query) {
                     index = j;
                     break;
                 }
             printf("%d %d\n", emp[index].boss, emp[index].sub);
         }
     }
 }