This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "robots.h"
#include <bits/stdc++.h>
using namespace std;
int putaway(int A, int B, int T, int X[], int Y[], int W[], int S[]) {
    multiset<pair<int, int>> st;
    for (int i = 0; i < T; ++i) {
        st.insert({W[i], S[i]});
    }
    int cnt = 0;
    while (!st.empty()) {
        cnt++;
        for (int i = 0; i < A; ++i) {
            auto low = st.lower_bound({X[i], 0});
            if (low == st.begin()) {
                if (i == A - 1) {
                    return -1;
                }
                continue;
            }
            st.erase(--low);
        }
    }
    return cnt;
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |