Submission

Score: 0

User: Trin1506

Problemset: ร้านปลอดภาษี (Duty Free)

Language: cpp

Time: 0.000 second

Submitted On: 2026-04-24 17:24:59

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using pll = pair<ll,ll>;
int minimum_bag_rearrangement_time(vector<int>& a) {
    int rounds = 0;
    int sz = 0;

    for (int x : a) {
        sz++;
        if (x < sz) {
            rounds++;
            sz = 1;
        }
    }
    return rounds;
}