c++ nha mấy bn pro =)))

#include <bits/stdc++.h>
using namespace std;
int n,a[100005],b[100005];
int main()
{
    cin >> n;
    for(int i = 1; i <= n ; i++)
        {cin >> a[i];
         b[i] = a[i];
        }
    sort(b+1,b+n+1);
    for(int i = 1; i <= n; i++)
    {
        cout << (lower_bound(b+1,b+n+1,a[i]) - b )- 1 << ' ' ;
    }
    return 0;
}

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

int n, a[N], b[N];

int main() {

cin >> n;

for (int i = 1; i <= n; ++i) {

cin >> a[i];

b[i] = a[i];

}

sort(b + 1, b + n + 1);

for (int i = 1; i <= n; ++i) {

int l = 1, r = n;

while (l < r) {

int mid = (l + r) / 2;

if (b[mid] >= a[i]) r = mid;

else l = mid + 1;

}

cout << l - 1 << " ";

}

return 0;

}