fork download
copy 
  1. #include <bits/stdc++.h>
  2. #define salma ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
  3. #define RW freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  4. typedef long long ll;
  5. typedef long double ld;
  6. #define F first
  7. #define S second
  8. using namespace std;
  9. const ll N = 1e5 + 5;
  10. const ll INF =1e18;
  11. const ll mod = 1e9 + 7;
  12. const double pi = 2 * acos(0);
  13. //int dy[]= {1,-1,0,0,1,1,-1,-1};
  14. //int dx[]= {0,0,1,-1,1,-1,-1,1};
  15. int n, m, arr[1005][1005];
  16. pair<int, pair<int, int> >  vec[5]; // num , x , y
  17.  
  18. int main()
  19. {
  20.     cin>>n>>m;
  21.     for(int i =0 ; i<n ; i++)
  22.         for(int j=0 ; j<m ; j++)
  23.             cin>>arr[i][j];
  24.  
  25.  
  26.  
  27.     for(int i=0 ; i<n; i++)
  28.     {
  29.         for(int j=0 ; j<m; j++)
  30.         {
  31.             if(arr[i][j] > vec[0].F)
  32.             {
  33.                 vec[0].F = arr[i][j];
  34.                 vec[0].S.F = i;
  35.                 vec[0].S.S = j;
  36.             }
  37.         }
  38.     }
  39.  
  40.     for(int i=0 ; i<n; i++)
  41.     {
  42.         if(i == vec[0].S.F)
  43.             continue;
  44.  
  45.         for(int j=0 ; j<m; j++)
  46.         {
  47.             if(arr[i][j] > vec[1].F)
  48.             {
  49.                 vec[1].F = arr[i][j];
  50.                 vec[1].S.F = i;
  51.                 vec[1].S.S = j;
  52.             }
  53.         }
  54.     }
  55.     for(int i=0 ; i<n; i++)
  56.     {
  57.         for(int j=0 ; j<m; j++)
  58.         {
  59.             if(j == vec[0].S.S)
  60.                 continue;
  61.             if(arr[i][j] > vec[2].F)
  62.             {
  63.                 vec[2].F = arr[i][j];
  64.                 vec[2].S.F = i;
  65.                 vec[2].S.S = j;
  66.             }
  67.         }
  68.     }
  69.     for(int i=0 ; i<n; i++)
  70.     {
  71.         if(i == vec[0].S.F)
  72.             continue;
  73.  
  74.         for(int j=0 ; j<m; j++)
  75.         {
  76.             if(j == vec[1].S.S)
  77.                 continue;
  78.             if(arr[i][j] > vec[3].F)
  79.             {
  80.                 vec[3].F = arr[i][j];
  81.                 vec[3].S.F = i;
  82.                 vec[3].S.S = j;
  83.             }
  84.         }
  85.     }
  86.     for(int i=0 ; i<n; i++)
  87.     {
  88.         if(i == vec[2].S.F)
  89.             continue;
  90.  
  91.         for(int j=0 ; j<m; j++)
  92.         {
  93.             if(j == vec[0].S.S)
  94.                 continue;
  95.             if(arr[i][j] > vec[4].F)
  96.             {
  97.                 vec[4].F = arr[i][j];
  98.                 vec[4].S.F = i;
  99.                 vec[4].S.S = j;
  100.             }
  101.         }
  102.     }
  103.  
  104.     if(vec[3].F >= vec[4].F)
  105.         cout<<vec[2].S.F + 1<<" "<<vec[0].S.S + 1;
  106.     else
  107.          cout<<vec[0].S.F + 1<<" "<<vec[1].S.S + 1;
  108.  
  109.  
  110.  
  111.  
  112.     return 0;
  113. }
Success #stdin #stdout 0s 4400KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
1 1
https://ideone.com/sftxKU
language:
C++14 (gcc 8.3)
created:
3 years 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!