SCAU 18935 贪吃的小Q

#include<malloc.h>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<math.h>
#include<queue>
using namespace std;
int n,m;
int sum(int s)
{
    int sum1=0;
    int i=0;
    for(i=0;i<n;i++)
    {
        sum1+=s;
        s=(s+1)/2;
    }
    return sum1;
}

int erfen()
{
    if(n==1) return m;
    int l=1,r=m,middle;
    while(l<=r)
    {
        middle=(l+r)/2;
        if(sum(middle)==m) return middle;
        else if(sum(middle)<m) l=middle+1;
        else r=middle-1;
    }
    return  r;
}

int main()
{
       cin>>n>>m;
       int ans=erfen();
       cout<<ans;
       return 0;
}