Sorting coins

#include <cstdio>
#include <iostream>
#include <utility>
#include <vector>

using namespace std;

int binarySearch(vector<pair<int, int>> &nums, int low, int high, int x, int m)
{
	int last_suitable = m + 1;
	while (low <= high) {
		int mid = low + (high - low) / 2;

		// Check if x is present at mid
		if (nums[mid].first == x)
			return nums[mid].second;

		// If x greater, ignore left half
		if (nums[mid].first < x) {
			low = mid + 1;
		}

		// If x is smaller, ignore right half
		else {
			last_suitable = nums[mid].second;
			high = mid - 1;
		}
	}

	// If we reach here, then element was not present
	return last_suitable;
}

int main(int argc, char *argv[])
{
	// Read the input parameters
	int n, m;
	cin >> n >> m;

	// Read values from one line
	vector<int> coin_radius(n);
	for (int i = 0; i < n; i++) {
		cin >> coin_radius[i];
	}

	// Read values from one line
	vector<int> hole_radius(m + 1);
	vector<pair<int, int> > aux_array;
	pair<int, int> last = make_pair(0, 0);
	int aux_length = 0;
	for (int i = 1; i < m + 1; i++) {
		cin >> hole_radius[i];
		if (last.first < hole_radius[i]) {
			last = make_pair(hole_radius[i], i);
			aux_array.push_back(last);
			aux_length++;
		}
	}

	for (int c = 0; c < n; c++) {
        int res = binarySearch(aux_array, 0, aux_length, coin_radius[c], m);
        if (res == 0) res = m + 1;
		cout << res << " ";
	}

	// for (int c = 0; c < n; c++) {
	// 	bool found = false;
	// 	for (int h = 1; h < m + 1; h++) {
	// 		if (hole_radius[h] >= coin_radius[c]) {
	// 			cout << h << " ";
	// 			found = true;
	// 			break;
	// 		}
	// 	}
	// 	if (!found)
	// 		cout << m + 1 << " ";
	// }

	cout << "\n";

	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: ACCEPTED

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED