Submission #44715717

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}



signed main()
{
    int N; cin >> N;
    vector<vector<ll>> deli(N);
    rep(i, N)
    {
        int f; ll S; cin >> f >> S;
        deli[f - 1].push_back(S);
    }

    ll res = -LINF;
    vector<ll> tmp;
    rep(i, N)
    {
        sort(begin(deli[i]), end(deli[i]));
        reverse(begin(deli[i]), end(deli[i]));

        if(deli[i].size() > 0)
        {
            tmp.push_back(deli[i][0]);
        }
        if(deli[i].size() >= 2)
        {
            chmax(res, deli[i][0] + deli[i][1] / 2);
        }
    }

    sort(begin(tmp), end(tmp));
    reverse(begin(tmp), end(tmp));
    if(tmp.size() >= 2)
    {
        chmax(res, tmp[0] + tmp[1]);
    }
    cout << res << endl;
}

Submission Info

Judge Result