为啥卡我 STL map ???

#include<cstdio>
#include<algorithm>
#include<map>
#define N 1000002
#define Min(a,b) a<b?a:b
using namespace std;
int n,k,cnt=0,ans=1e9;
map<int,int> have;
struct point{
    int x,t;
}m[N];
inline void read(int& x){
    int sign =1;x = 0;char c;
    for(c=getchar();(c < '0' || c > '9') && c != '-';c = getchar());
    if(c == '-') sign = -1;else x = c - '0';
    for(c=getchar();c <= '9' && c >= '0';x = x*10 + c - '0',c = getchar());
    x = x*sign;
}
bool comp(point a,point b){
    return a.x<b.x;
}
int main() {
    read(n);read(k);
    for(int i=1;i<=k;i++){
        int j;
        read(j);
        for(;j;j--){
            int x;
            read(x);
            m[++cnt].t=i;
            m[cnt].x=x;
        }
    }
    sort(m+1,m+1+n,comp);
    int h=1,t=1;have[m[1].t]++;
    while(t<=n){
        while(have.size()<k && h+1 <=n){
            h++;
            have[m[h].t]++;
        }
        if(have.size() == k)
            ans= Min(ans,(m[h].x-m[t].x));
        while(m[t+1].x == m[t].x){
            have[m[t].t]--;
            if((have[m[t].t]) == 0){
                have.erase(m[t].t);
            }
            t++;
        }
            have[m[t].t]--;
            if((have[m[t].t]) == 0){
                have.erase(m[t].t);
            }
            t++;
    }
    printf("%d\n",ans);
    return 0;
}

#include<cstdio>
#include<algorithm>
#define N 1000002
#define Min(a,b) a<b?a:b
using namespace std;
int n,k,cnt=0,ans=1e9;
int have[65];
struct point{
    int x,t;
}m[N];
inline void read(int& x){
    int sign =1;x = 0;char c;
    for(c=getchar();(c < '0' || c > '9') && c != '-';c = getchar());
    if(c == '-') sign = -1;else x = c - '0';
    for(c=getchar();c <= '9' && c >= '0';x = x*10 + c - '0',c = getchar());
    x = x*sign;
}
bool comp(point a,point b){
    return a.x<b.x;
}
int main() {
    read(n);read(k);
    for(int i=1;i<=k;i++){
        int j;
        read(j);
        for(;j;j--){
            int x;
            read(x);
            m[++cnt].t=i;
            m[cnt].x=x;
        }
    }
    sort(m+1,m+1+n,comp);
    int h=1,t=1,size=1;have[m[1].t]++;
    while(t<=n){
        while(size<k && h+1 <=n){
            h++;
            if(have[m[h].t]++ == 0)size++;
        }
        if(size == k)
            ans= Min(ans,(m[h].x-m[t].x));
        while(m[t+1].x == m[t].x){
            have[m[t].t]--;
            if((have[m[t].t]) == 0){
                size--;
            }
            t++;
        }
            have[m[t].t]--;
            if((have[m[t].t]) == 0){
                size--;
            }
            t++;
    }
    printf("%d\n",ans);
    return 0;
}
···