Submission #44720468

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pk pop_back
#define fr first
#define sc second
#define endl '\n'
#define upb upper_bound
#define lob lower_bound
const ll mod = 1000000007, mod2 = 998244353;
const ll INF = INT_MAX, INF2 = LLONG_MAX-1;
int n;
pair<ll, ll> a[300005];
void solve(){
    cin >> n;
    for (ll i = 0; i < n; ++i){
        cin >> a[i].sc >> a[i].fr;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pk pop_back
#define fr first
#define sc second
#define endl '\n'
#define upb upper_bound
#define lob lower_bound

const ll mod = 1000000007, mod2 = 998244353;
const ll INF = INT_MAX, INF2 = LLONG_MAX-1;

int n;
pair<ll, ll> a[300005];

void solve(){
    cin >> n;
    for (ll i = 0; i < n; ++i){
        cin >> a[i].sc >> a[i].fr;
    }
    sort(a, a+n);
    ll ans = 0;
    for (ll i = n-2; i >= 0; --i){
        if(a[i].sc == a[n-1].sc) ans = max(ans, a[i].fr/2 + a[n-1].fr);
        else ans = max(ans, a[i].fr + a[n-1].fr);
    }
    cout << ans;
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int tt = 1; 
    while(tt--){
        solve(); 
        cout << endl;
    }
    return 0;
}

Submission Info

Judge Result