[SCOI2009]生日礼物
void solve()
{
cin >> n >> k;
int c = 0;
rep(i,1,k) {
int num, x;
cin >> num;
rep(j,1,num) {
cin >> x;
a[++c] = {x,i};
}
}
sort(a+1,a+1+n);
int ans = INT_MAX;
int l = 1;
rep(r,1,n) {
cnt[a[r].ss]++;
while(ok()) {
ans = min(ans, a[r].ff - a[l].ff);
cnt[a[l++].ss]--;
}
}
cout << ans;
}