PTA——装箱问题

/*
 * @Description: 
 * @version: 
 * @Author: 
 * @Date: 2021-05-14 19:27:11
 * @LastEditors: Please set LastEditors
 * @LastEditTime: 2021-05-14 20:07:21
 */
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
    vector<int> S;
    vector<pair<int, int>> box{make_pair(1, 100)};
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        int s;
        cin >> s;
        S.push_back(s);
    }
    for (int i = 0; i < n; i++)
    {
        cout << S[i] << " ";
        bool flag = false;
        for (auto it = box.begin(); it != box.end(); ++it)
        {
            if (it->second >= S[i])
            {
                it->second -= S[i];
                flag = true;
                cout << it->first << endl;
                break;
            }
        }
        if (!flag)
        {
            box.push_back(make_pair(box.size() + 1, 100 - S[i]));
            cout << box.size() << endl;
        }
    }
    cout << box.size() << endl;
    return 0;
}