|| ||Code Submission Evaluation System
CSES Problem Set
Task | Statistics
CSES - Concert TicketsCSES - Concert Tickets
|Time limit:||1.00 s
||Memory limit:||512 MB|
There are $n$ concert tickets available, each with a certain price. Then, $m$ customers arrive, one after another.
Each customer announces a maximum price they can pay for a ticket, and after this, they will get a ticket whose price is the nearest possible price which does not exceed the maximum price.
The first input line contains integers $n$ and $m$: the number of tickets and the number of customers.
The next line contains $n$ integers $h_1,h_2,\ldots,h_n$: the price of each ticket.
The last line contains $m$ integers $t_1,t_2,\ldots,t_m$: the maximum price for each customer.
Print, for each customer, the price that they will pay for their ticket. After this, the ticket cannot be purchased again.
If a customer cannot get any ticket, print $-1$.
- $1 \le n, m \le 2 \cdot 10^5$
- $1 \le h_i, t_i \le 10^9$
5 3 7 8 5
4 8 3