Submission #20726249

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
bool my_compare(pair<int, int> a, pair<int, int> b) {

    if(a.second != b.second){
        return a.second < b.second;
    }else{
        // どちらも同じ
        return true;
    }
}
int main(){
        int n;
        cin >>n;
  vector<pair<int,int>> a(n);
  vector<pair<int,int>>b(n);

  for(int i =0;i< n;i++)
  {
      a[i].first = i;
      b[i].first = i;
      cin >> a[i].second>>b[i].second;
  }
  int w,x,y,z;
  sort(a.begin(), a.end(), my_compare);
  sort(b.begin(), b.end(), my_compare);
  w = a[0].second;
  x = a[1].second;
  y = b[0].second;
  z = b[1].second;
  int ans[4];
  
  if(a[0].first ==b[0].first)
  {
      ans[0] = w + y;
  }
  else if(a[0].first !=b[0].first)
  {
      ans[0] = max(w,y);
  }
  
  if(a[0].first ==b[1].first)
  {
      ans[1] = w + z;
  }
  
  else if(a[0].first !=b[1].first)
  {
      ans[1] = max(w,z);
  }
  
  if(a[1].first ==b[0].first)
  {
      ans[2] = x + y;
  }
  else if(a[1].first !=b[0].first)
  {
      ans[2] = max(x,y);
  }
  
  if(a[1].first ==b[1].first)
  {
      ans[3] = x + z;
  }
  else if(a[1].first !=b[1].first)
  {
      ans[3] = max(x,z);
  }
  sort(ans, ans+4);
  cout << ans[0] <<endl;
  return 0;
}

Submission Info

Judge Result