~/algor $ cat masalalar/dp-eng-kam-tangalar
DP-02
Eng kam tangalar
Muallif:
Iqbolshoh Ilhomjonov
O'rtacha
1000 ms
128 MB
56%
$n$ xil qiymatli tangalar bor: $c_{1}, c_{2}, \dots, c_{n}$; har biridan istalgancha olish mumkin. Jami aynan $S$ so'm bo'ladigan qilib eng kamida nechta tanga olish kerakligini aniqlang. $S$ ni yig'ib bo'lmasa, $-1$ chiqaring.
Kiruvchi ma'lumotlar
Birinchi qatorda ikkita butun son: $n$ va $S$. Ikkinchi qatorda $n$ ta har xil natural son $c_{j}$.
Chiquvchi ma'lumotlar
Bitta butun son — eng kam tangalar soni yoki $-1$.
Izoh
$1 \le n \le 50$
$0 \le S \le 10^{4}$
$1 \le c_{j} \le 10^{4}$
Misollar
Kirish #1
3 11 1 2 5
Chiqish #1
3
Kirish #2
2 3 2 4
Chiqish #2
-1