Submission #60323453

---

Source Code Expand

#include <bits/stdc++.h>
#include <vector>

using namespace std;

/*

add the index to the value when making the sushis list
sort the sushis list, so you know its always going to be

*/

void solve() {
	int n, m;
	cin >> n >> m;
	vector<int> gourmets;
	vector<int> result(m);
	vector<pair<int, int>> delic;
	int minG = INT_MAX;
	for (int i = 0; i < n; i++) {
		int x;
		cin >> x;
		gourmets.push_back(x);
		if (x < minG) {
			minG = x;
		}
	}
	for (int i = 0; i < m; i++) {
		int x;
		cin >> x;
		delic.push_back({x, i});
	}

	std::sort(delic.begin(), delic.end(),
			  [](auto& left, auto& right) { return left.first > right.first; });
	// for (auto& deli : delic) {
	// 	cout << "sushi: " << deli.first << endl;
	// }
	for (int i = 0, j = 0; i < m; i++) {
		int sushi = delic[i].first;
		if (sushi < minG) {
			result[delic[i].second] = -1;
			continue;
		}
		// cerr << "delic[i].first: " << delic[i].first << endl;
		// cerr << "gourmets[j]: " << gourmets[j] << endl;
		while (j < n && delic[i].first < gourmets[j])
			j++;
		// cerr << "j: " << j << endl;

		result[delic[i].second] = j + 1;
	}
	for (auto& res : result) {
		cout << res << endl;
	}
}

int main() {
	int t = 1;
	while (t--)
		solve();
	return 0;
}

Submission Info

Judge Result