[Link] https://www.acmicpc.net/problem/1092
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <cstring>
#include <stack>
// #include <bits/stdc++.h>
using namespace std;
#define for0(i, n) for(int i = 0; i < n; i++)
#define for1(i, n) for(int i = 1; i < n; i++)
#define fori(s, e) for(int i = s; i < e; i++)
#define ll long long
#define endl "\n"
#define nulls '\0'
#define dkdk " "
const int MAX = 5e5 + 1;
const int INF = 987654321;
int n, m;
vector<int> crane;
multiset<int> lugage;
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n;
crane.resize(n);
for0(i, n) cin >> crane[i];
cin >> m;
for0(i, m) { int in; cin >> in; lugage.insert(in); }
sort(crane.begin(), crane.end(), greater<int>());
int time = 0;
bool can = true, break_all = false;;
while(1) {
for0(i, n) {
multiset<int>::iterator iter = upper_bound(lugage.begin(), lugage.end(), crane[i]);
if(iter == lugage.begin()) {
if(i == 0) {
cout << -1;
return 0;
}
break;
}
lugage.erase(--iter);
if(lugage.empty()) { break_all = true; break; }
}
time++;
if(break_all) break;
}
cout << time;
return 0;
}