题解 | #六一儿童节#
六一儿童节
https://www.nowcoder.com/practice/d2dfc62bf1ba42679a0e358c57da9828
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int n, m; cin >> n; vector<int> h(n); for (int i = 0; i < n; i++) cin >> h[i]; cin >> m; vector<int> w(m); for (int i = 0; i < m; i++) cin >> w[i]; sort(h.begin(), h.end(), [&](const int& a, const int& b){ return a > b; }); sort(w.begin(), w.end(), [&](const int& a, const int& b){ return a > b; }); int l = 0, r = 0; while (l < n && r < m) { if (h[l] <= w[r]) l++, r++; else if (h[l] > w[r]) l++; } cout << r << endl; return 0; } // 64 位输出请用 printf("%lld")