Submission #44740870

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define pb(a) push_back(a)
#define MAX(a, b) ((a < b)?b:a)
#define MIN(a, b) ((a > b)?b:a)
#define lcm(a, b) (a / gcd(a, b) * b) // 最小公倍数

typedef long long int ll;
typedef unsigned long long int ull;
typedef unsigned int uint;
using namespace std;
// -------------------------------------

// hoge[fi] = [ソート済みの美味しさ] max2

// max of i(hoge[fi][0] + hoge[fi][1]/2)
// hoge[fi]の上位2つ

vector<int> fi_list[3*100000 + 9];

int main() {
  int N;
  cin >> N;
  
  rep(i, N) {
    int f, s;
    cin >> f >> s;
    fi_list[f].pb(s);
  }

  rep(i, N+1) {
    sort(fi_list[i].rbegin(), fi_list[i].rend());
  }

  int ans = 0;
  vector<int> diff_taste;
  rep(i, N+1) {
    if ( fi_list[i].size() > 0 ) diff_taste.pb(fi_list[i][0]);

    if ( fi_list[i].size() >= 2 ) {
      ans = max(ans, fi_list[i][0] + fi_list[i][1] / 2);
    }

    // test
    // cout << i << ": ";
    // rep(j, fi_list[i].size()) cout << fi_list[i][j] << ", ";
    // cout << endl;
  }

  sort(diff_taste.rbegin(), diff_taste.rend());
  if ( diff_taste.size() >= 2 ) {
    ans = max(ans, diff_taste[0] + diff_taste[1]);
  }

  cout << ans << endl;
	return 0;
}

Submission Info

Judge Result