Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define rep(_I,_A,_B) for(lli _I=_A;_I<_B;_I++)
- #define opv(_VAR) cout << #_VAR << ":" << _VAR << "\n";
- #define opvec(_VEC) cout << #_VEC << ":"; rep(_I,0,_VEC.size()){ cout<<_VEC[_I]<<" "; } cout<<"\n";
- #define oparr(_VEC,_N) cout << #_VEC << ":"; rep(_I,0,_N){ cout<<_VEC[_I]<<" "; } cout<<"\n";
- typedef long long int lli;
- typedef vector<lli> vlli;
- typedef vector<int> vi;
- typedef vector<string> vs;
- typedef vector<pair<lli,lli>> vplli;
- int main() {
- lli n,m;
- vector<vlli> arr;
- cin>>n>>m;
- //cin>>m>>n;
- vlli inp(m);
- rep(i,0,n){
- inp.assign(m,0);
- rep(j,0,m) cin>>inp[j];
- arr.push_back(inp);
- }
- lli mx=-1,my=1000000000,ind=-1,cnt=0;
- vplli ans;
- rep(i,0,n){
- mx=*max_element(arr[i].begin(),arr[i].end());
- if(count(arr[i].begin(),arr[i].end(),mx)>1)continue;
- ind=find(arr[i].begin(),arr[i].end(),mx)-arr[i].begin();
- //opv(mx);
- //opv(ind);
- rep(j,0,n){
- my=min(arr[j][ind],my);
- }
- //opv(my);
- if(mx==my)ans.push_back({i+1,ind+1});
- }
- if(ans.size()==0)cout<<"0 0";
- else {
- sort(ans.begin(),ans.end());
- cout<<ans[0].first<<" "<<ans[0].second;
- }
- }
Add Comment
Please, Sign In to add comment