Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <algorithm>
- using namespace std;
- ifstream fin("bal.in");
- ofstream fout("bal.out");
- void citire(int a[], int& n)
- {
- for(int i=0; i<n; i++)
- fin >> a[i];
- }
- int main()
- {
- int n, m, f[100001]={0}, b[100001]={0};
- fin >> n >> m;
- citire(f, n);
- citire(b, m);
- sort(f, f+n);
- sort(b, b+m);
- int nrPerechi=0, i=0, j=0;
- while (i<n && j<m)
- {
- if (f[i] <= b[j])
- {
- nrPerechi++;
- i++;
- j++;
- }
- else
- j++;
- }
- fout<<nrPerechi;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement