Educational Codeforces Round 158 (Rated for Div. 2)
Problem-A-Codeforces#include#defineendl'\n'#defineintlonglongusingnamespacestd;constintN=55;inta[N];intn,x;voidsolve(){cin>>n>>x;for(inti=1;i>a[i];a[n+1]=1000;intans=0;intpos=lower_bound(a+1,a+1+n+1,x