mirror of
https://github.com/tiennm99/codeforces.git
synced 2026-06-09 12:14:23 +00:00
[Init] Solved solutions
This commit is contained in:
@@ -0,0 +1,19 @@
|
||||
#include <iostream>
|
||||
#include <algorithm>
|
||||
using namespace std;
|
||||
int main()
|
||||
{
|
||||
int n, m;
|
||||
long long int *a, *b;
|
||||
cin >> n >> m;
|
||||
a = new long long int[n];
|
||||
b = new long long int[m];
|
||||
for (int i = 0; i < n; i++)
|
||||
cin >> a[i];
|
||||
for (int i = 0; i < m; i++)
|
||||
cin >> b[i];
|
||||
sort(a, a + n);
|
||||
for (int i = 0; i < m; i++)
|
||||
cout << upper_bound(a, a + n, b[i]) - a << " ";
|
||||
return 0;
|
||||
}
|
||||
Reference in New Issue
Block a user