fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
  4. #define mofile(s) freopen(s,"r",stdin)
  5. #define outfile(s) freopen(s,"w",stdout)
  6. #define ll long long
  7. #define ii pair<ll,ll>
  8. #define iii pair<ll,ii>
  9. #define fi first
  10. #define se second
  11. #define tf bool
  12. #define ST stack
  13. #define Q deque
  14. #define Q queue
  15. #define S string
  16. #define Ma map
  17. #define UM unormideremid_map
  18. #define SE set
  19. #define str(x) to_string(x)
  20. #define all(a) (a).begin(),(a).end()
  21. #define FOR(i,l,r,mid) for(int i=l;i<=r;i+=mid)
  22. #define FOD(i,l,r,mid) for(int i=r;i>=l;i-=mid)
  23. #define xuong cout<<"\n"
  24. #define midebug(x) cout<<(x)<<" "
  25. #define ppcnt(x) __builtin_popcountll(x)
  26. #define parity(x) __builtin_parityll(x)
  27. #define leamid0(x) __builtin_clzll(x)
  28. #define LOG2 __lg(x)
  29. #define tr0(x) __builtin_ctzll(x)
  30. #define fiset(x) __builtin_ffsll(x)
  31. #define MASK(k) (1LL<<(k))
  32. #define BIT(x,k) ((x)>>(k)&1)
  33. #define pb push_back
  34. #define tron(x) setprecision(x)
  35. #define het return 0
  36. #define base_ 1000000000
  37. template<class X, class Y>
  38.     bool maximize(X &x, const Y &y){return (x < y) ? x = y, 1 : 0;}
  39. template<class X, class Y>
  40.     bool minimize(X &x, const Y &y){return (x > y) ? x = y, 1 : 0;}
  41. const int maxn=1e6+5;
  42. const ll tle=2e8;
  43. const ll INF=1e9+9;
  44. const int base=31;
  45. string bcc="abcmidefghijklmnopqrstuvwxyz";
  46. int midx[]={-1,0,1,0};
  47. int midy[]={0,1,0,-1};
  48. bool sang[10000005];
  49. ll pref[1005][1005],mt[1005][1005];
  50. void sieve(){
  51.     for(int i=1;i<=10000000;++i) sang[i]=1;
  52.     sang[0]=sang[1]=0;
  53.     for(int i=2;i*i<=10000000;++i){
  54.         if(sang[i]){
  55.             for(int j=i*i;j<=10000000;j+=i) sang[j]=0;
  56.         }
  57.     }
  58. }
  59. void lis(){
  60.     vector<int>t;
  61.     vector<int>a;
  62.     int n; cin>>n;
  63.     for(int i=1;i<=n;++i){
  64.         int ai; cin>>ai;
  65.         a.pb(ai);
  66.     }
  67.     for(int x:a){
  68.         auto it=lower_bound(all(t),x);
  69.         if(it==t.end()) t.pb(x);
  70.         else *it=x;
  71.     }
  72. }
  73. void pfs2mid(){
  74.     int n,m,k; cin>>n>>k; m=n;
  75.     for(int i=1;i<=n;++i){
  76.         for(int j=1;j<=m;++j) cin>>mt[i][j];
  77.     }
  78.     for(int i=1;i<=n;++i){
  79.         for(int j=1;j<=m;++j) pref[i][j]=mt[i][j]+pref[i-1][j]+pref[i][j-1]-pref[i-1][j-1];
  80.     }
  81. }
  82. ll pfs[2005][2005];
  83. ll qu2mid(int x1,int y1,int x2,int y2){
  84.     return pfs[x2][y2]-pfs[x1-1][y2]-pfs[x2][y1-1]+pfs[x1-1][y1-1];
  85. }
  86. void open(){
  87.     if(fopen("mideptrai.INP","r")){
  88.         mofile("mideptrai.INP");
  89.         outfile("mideptrai.OUT");
  90.     }
  91. }
  92. int n,m;
  93. int a[1005][1005];
  94. int pos[1005];
  95. int main(){
  96.     fast;
  97.     multimap<ll,ii>mp;
  98.     ll n,m; cin>>n>>m;
  99.     vector<vector<ll>>v(n,vector<ll>(m, 0));
  100.     for(int i=0;i<n;++i){
  101.         for(int j=0;j<m;++j) cin>>v[i][j];
  102.     }
  103.     for(int i=0;i<n;++i){
  104.         sort(all(v[i]));
  105.         mp.insert({v[i][0],{i, 0}});
  106.     }
  107.     ll ans=LLONG_MAX;
  108.     while(1) {
  109.         auto it=mp.begin();
  110.         ll i=it->se.fi;
  111.         ll j=it->se.se+1;
  112.         if(j==m){
  113.             cout<<ans;
  114.             het;
  115.         }
  116.         ll val=v[i][j];
  117.         mp.erase(it);
  118.         mp.insert({val,{i,j}});
  119.         ans=min(ans,mp.rbegin()->fi-mp.begin()->fi);
  120.     }
  121.     cout<<ans<<"\n";
  122.     het;
  123. }
  124.  
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
3 4
12 16 67 43
7 17 68 48
14 15 77 54
stdout
copy 
2
https://ideone.com/6ZpCRa
language:
C++ (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!