{"problem":{"name":"019. Boomilever","description":{"content":"You are working on your Boomilevers for Science Olympiad, an event that requires the breaking of various \"boomilevers\". For this problem, you are given a list of numbers representing the force you app","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10269019"},"statements":[{"statement_type":"Markdown","content":"You are working on your Boomilevers for Science Olympiad, an event that requires the breaking of various \"boomilevers\". For this problem, you are given a list of numbers representing the force you applied to each boomilever in pounds. You know a certain number of pounds that will always break any boomilever. Given these values, calculate how many of your boomilevers have broken so far.\n\nThe first line of input contains two space-separated integers _n_ and _m_ representing the number of boomilevers, and the force required to break a boomilever, respectively. The next line contains _n_ space-separated integers representing the force applied to each boomilever.\n\nOutput a single positive integer _b_: the number of boomilevers that have broken so far.\n\n## Input\n\nThe first line of input contains two space-separated integers _n_ and _m_ representing the number of boomilevers, and the force required to break a boomilever, respectively. The next line contains _n_ space-separated integers representing the force applied to each boomilever.\n\n## Output\n\nOutput a single positive integer _b_: the number of boomilevers that have broken so far.\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ n \\in \\mathbb{Z}^+ $ be the number of boomilevers.  \nLet $ m \\in \\mathbb{Z}^+ $ be the minimum force required to break a boomilever.  \nLet $ F = (f_1, f_2, \\dots, f_n) $ be a sequence of integers representing the force applied to each boomilever.\n\n**Constraints**  \n1. $ n \\geq 1 $  \n2. $ m \\geq 1 $  \n3. $ f_i \\geq 1 $ for all $ i \\in \\{1, \\dots, n\\} $\n\n**Objective**  \nCompute the number of boomilevers that broke:  \n$$\nb = \\left| \\left\\{ i \\in \\{1, \\dots, n\\} \\mid f_i \\geq m \\right\\} \\right|\n$$","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10269019","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}