Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main() {
- int n,m,k,sum = 0;
- cin >> n >> m;
- n *= m;
- int* arrn = new int[n];
- for (int i = 0; i < n; i++) {
- cin >> arrn[i];
- }
- cin >> k;
- int* arrk = new int[k];
- for (int i = 0; i < k; i++) {
- cin >> arrk[i];
- }
- for (int i = 1; i < n; i++) {
- int j = i;
- while (j && arrn[j - 1] > arrn[j]) {
- swap(arrn[j - 1], arrn[j]);
- j--;
- }
- }
- for (int i = 1; i < n; i++) {
- int j = i;
- while (j && arrk[j - 1] > arrk[j]) {
- swap(arrk[j - 1], arrk[j]);
- j--;
- }
- }
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < n; j++) {
- if (arrn[i] >= arrk[j] && arrk[j] != 0) {
- sum++;
- arrk[j] = 0;
- arrn[i] = 0;
- }
- }
- }
- cout << sum;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement