Submission

Score: 16

User: foldnut

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

Language: cpp

Time: 1.085 second

Submitted On: 2025-12-21 20:01:44

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

int minimum_bag_rearrangement_time(std::vector<int> a) {
  set<int> s;
  int n = a.size(), ans = 0;
  for(int i = 1;i<=n;i++){
    s.insert(i);
  }
  vector<int> c;
  for(auto x : a){
    auto it = s.upper_bound(x);
    if(it == s.begin()){
      ++ans;
      for(auto cc : c) s.insert(cc);
      while(c.size()) c.pop_back();
      it = s.upper_bound(x);
    }
    --it;
    s.erase(*it);
    c.push_back(*it);
  }
  return ans;
}