fork download
  1. //Lib
  2. #include<cstdio>
  3. #include<cstring>
  4. #include<cstdlib>
  5. #include<cmath>
  6. #include<ctime>
  7.  
  8. #include<iostream>
  9. #include<algorithm>
  10. #include<vector>
  11. #include<string>
  12. #include<queue>
  13. #include<stack>
  14. #include<set>
  15. #include<map>
  16. using namespace std;
  17. //Macro
  18. #define rep(i,a,b) for(int i=a,tt=b;i<=tt;++i)
  19. #define drep(i,a,b) for(int i=a,tt=b;i>=tt;--i)
  20. #define erep(i,e,x) for(int i=x;i;i=e[i].next)
  21. #define irep(i,x) for(__typeof(x.begin()) i=x.begin();i!=x.end();i++)
  22. #define read() (strtol(ipos,&ipos,10))
  23. #define sqr(x) ((x)*(x))
  24. #define pb push_back
  25. #define PS system("pause");
  26. typedef long long ll;
  27. typedef pair<int,int> pii;
  28. const int oo=~0U>>1;
  29. const double inf=1e100;
  30. const double eps=1e-6;
  31. string name="", in=".in", out=".out";
  32. //Var
  33. priority_queue< pii,vector<pii>,greater<pii> > q;
  34. queue<int> c[61];
  35. int n,k,ans=oo,m;
  36. void Init()
  37. {
  38. scanf("%d%d",&n,&k);
  39. int a,t;
  40. rep(i,1,k)
  41. {
  42. scanf("%d",&t);
  43. rep(j,1,t)
  44. {
  45. scanf("%d",&a);
  46. c[i].push(a);
  47. }
  48. }
  49. }
  50. void Work()
  51. {
  52. pii x;
  53. rep(i,1,k)m=max(m,c[i].front()),q.push(pii(c[i].front(),i));
  54. while(1)
  55. {
  56. x=q.top();q.pop();
  57. ans=min(ans,m-x.first);
  58. c[x.second].pop();if(c[x.second].empty())break;
  59. q.push(pii(c[x.second].front(),x.second));m=max(m,c[x.second].front());
  60. }
  61. cout<<ans<<endl;
  62. }
  63. int main()
  64. {
  65. // freopen((name+in).c_str(),"r",stdin);
  66. // freopen((name+out).c_str(),"w",stdout);
  67. Init();
  68. Work();
  69. return 0;
  70. }
Not running #stdin #stdout 0s 0KB
stdin
Standard input is empty
stdout
Standard output is empty