Submission

Score: 60

User: Nuttykub

Problemset: ค่าแปลกๆ

Language: cpp

Time: 0.004 second

Submitted On: 2026-10-15 21:55:39

#include <bits/stdc++.h>
using namespace std;
#define ll long long

int main(){
    ll n;
    cin>>n;
    vector<pair<ll,ll>> vec(n);
    ll total=0;
    for(int i=0;i< n;i++){
        cin>>vec[i].first;
        total+=vec[i].first;
    }
    for(int i=0;i< n;i++){
        vec[i].second = abs(total-vec[i].first*n);
    }
    sort(vec.begin(),vec.end(),[](const pair<ll,ll>&a,const pair<ll,ll>&b){
        if(a.second != b.second) a.second>b.second;
        return a.first>b.first;
    });
    cout << vec[0].first;
}