1. #include <iostream>
    2. #include <string>
    3. #include <map>
    4. using namespace std;
    6. #define SIZE 100
    8. map<int, int> f, u;
    11. void request(int ms)
    12. {
    13.     if (ms == 0)
    14.     {
    15.         cout << "errro" << endl;
    16.         return ;
    17.     }
    19.     bool bsuccess = false;
    20.     for (auto it = f.begin(); it != f.end(); it ++)
    21.     {
    22.         // find bigger free mem
    23.         if (ms <= it->second)
    24.         {
    25.             int a = it->first + ms, b = it->second - ms;
    27.             cout << it->first << endl;
    29.             //  update used mem
    30.             u.insert({it->first, ms});
    32.             // erase old mem
    33.             f.erase(it);
    34.             // insert new
    35.             f.insert({a, b});
    36.             bsuccess = true;
    37.             break;
    38.         }
    39.     }
    40.     if (!bsuccess)  cout << "error" << endl;
    41. }
    43. void release(int ms)
    44. {
    45.     auto iter = u.find(ms);
    46.     if (iter == u.end())
    47.     {
    48.         cout << "error" << endl;
    49.         return ;
    50.     }
    53.     int e = iter->first + iter->second;
    54.     bool bfind = false;
    55.     for (auto it = f.begin(); it != f.end(); it ++)
    56.     {
    57.         if (e == it->first)
    58.         {
    59.             int a = iter->first, b = it->second + iter->second;
    60.             f.insert({a, b});
    62.             f.erase(it);
    64.             bfind = true;
    65.         }
    67.     }
    68.     if (!bfind) f.insert({iter->first, iter->second});
    69.     else
    70.     {
    71.         auto pre = f.begin();
    72.         for (auto it = f.begin(); it != f.end(); it ++)
    73.         {
    74.             if (it == f.begin()) continue;
    75.             if (pre->first + pre->second == it->first)
    76.             {
    77.                 pre->second += it->second;
    78.                 f.erase(it);
    79.                 break;
    80.             }
    81.             pre = it;
    82.         }
    83.     }
    85.     u.erase(iter);
    86. }
    88. int getNum(const string& s)
    89. {
    90.     int i=0;
    91.     while (s[i] != '=') i++;
    92.     i++;
    94.     int num = 0;
    95.     while (i < s.size())
    96.         num = num * 10 + (int)(s[i] - '0'), i++;
    98.     return num;
    99. }
    101. int main()
    102. {
    103.     f.insert({0, SIZE});
    105.     int n;
    106.     cin >> n;
    107.     string op;
    108.     while (n--)
    109.     {
    110.         cin >> op;
    112.         int ms = getNum(op);
    113.         if (op[2] == 'Q')
    114.             request(ms);
    115.         else
    116.             release(ms);
    118.     }
    119.     return 0;
    120. }