Codeforces732E Sockets

首先检测有木有和Computer匹配的Socket，如果有则将其匹配。

然后将所有没有匹配的Socket连上Adapter，再去检测有木有Computer与Socket匹配。

重复这个操作31次，所有Socket的power都变成1了，如果再不能匹配就结束程序。

 #include <bits/stdc++.h>
 using namespace std;

 struct PC
 {
     int power;
     int idx;
     friend bool operator< (const PC& a, const PC& b)
     {
         return a.power < b.power;
     }
 };
 int s[];
 bool vis[];
 int a[];
 int b[];

 int main()
 {
     int n, m;
     scanf("%d%d", &n, &m);
     multiset<PC> pc;
     int p;
     for (int i = ; i <= n; i++)
     {
         scanf("%d", &p);
         pc.insert({p, i});
     }
     for (int i = ; i <= m; i++)
         scanf("%d", s + i);
     int c = , u = ;
     for (int i = ; i < ; i++)
     {
         for (int j = ; j <= m; j++)
         {
             if (!vis[j])
             {
                 multiset<PC>::iterator it = pc.find({s[j], });
                 if (it != pc.end())
                 {
                     b[it->idx] = j;
                     vis[j] = true;
                     pc.erase(it);
                     c++;
                     u += a[j];
                 }
             }
         }
         for (int j = ; j <= m; j++)
             if (!vis[j])
                 a[j]++, s[j] = (s[j] + ) / ;
     }
     printf("%d %d\n", c, u);
     for (int i = ; i <= m; i++)
         printf("%d ", vis[i] ? a[i] : );
     puts("");
     for (int i = ; i <= n; i++)
         printf("%d ", b[i]);
     return ;
 }