为什么MLE

#include<iostream>
#include<cstdio>
#include<map>
#include<vector>
#include<algorithm>
#include<stack>
#include<queue>
#define interesting int
#define dodo double
#define read(x){    \
    x=0;    \
    register char ch=getchar(); \
    int a=1;    \
    while(ch<'0'||ch>'9'){  \
        if(ch=='-') a=-1;   \
        ch=getchar();   \
    }   \
    while(ch>='0'&&ch<='9'){    \
        x=(x<<3)+(x<<1)+(ch^48);    \
        ch=getchar();   \
    }   \
    x=x*a;  \
}
using namespace std;
map<interesting,interesting>a;
queue<interesting> b;
vector<interesting>c;
stack<interesting>d;
queue<interesting> e;
void gb(interesting l,interesting r){
    if(l>r) return;
    interesting mid=(l+r)/2;
    gb(l,mid);
    gb(mid+1,r);
    interesting i=l,j=mid+1;
    while(i<=mid&&j<=r){
        if(c[i]>c[j]){
            e.push(c[j]);
            j++;
        }else{
            e.push(c[i]);
            i++;
        }
    }
    while(i<=mid) e.push(c[i]),i++;
    while(j<=r) e.push(c[j]),j++;
    for(interesting i=l;i<=r;i++){
        c[i]=e.front();
        e.pop();
    }
}
interesting main(){

    interesting k[15];
    interesting j,B,A;
    for(interesting i=1;i<=10;i++)
            scanf("%d",&k[i]);
    cin>>j;
    B=j+30;
    interesting wawa=0;
    for(interesting i=1;i<=10;i++)
    {
    if(k[i]<=B)  
    wawa++ ;
    }
    cout<<wawa;

    interesting n;
    for(interesting i=1;i<=10;i++){
        interesting xx;
        xx=a[i];
        b.push(xx);
        b.pop();
        d.push(xx);
        d.pop();
        c.push_back(xx);
        a[xx]++;
    }
    //scanf("%d",&n);
    n=n+(3<<3)+(1<<2)+(1<<1);
    sort(c.begin(),c.end());
    make_heap(c.begin(),c.end());
    sort_heap(c.begin(),c.end());
    gb(0,9);
    interesting ans=0;
    for(interesting i=0;i<=10;i++){
        if(c[i]<=n) ans++;
    }
    printf("%d\n",ans);
}