Run ID Author Problem Lang Verdict Time Memory Code Length Submit Time
318110 lianghongrui 最大的和 T5 C++ Accepted 804 MS 900 KB 1381 2026-04-19 16:39:35

Tests(10/10):


#include<bits/stdc++.h> #define ll long long #define ull unsigned ll #define i128 __int128 #define db double #define str string #define endl '\n' #define pii pair<int,int> #define pll pair<ll,ll> #define mii map<int,int> #define mll map<ll,ll> #define all(a) a.begin(),a.end() using namespace std; const db pai=3.1415926; const int N=1e3+5,mod=1e9+7,inf=0x3f3f3f3f; const ll INF=0x3f3f3f3f3f3f3f3f; void O_O(){ int n,d; cin>>n>>d; vector<int>a(n),b(n); for(auto &x:a) cin>>x; for(auto &x:b) cin>>x; sort(all(a)); sort(all(b)); int ans=-inf; for(int i=0;i<n;i++){ int t=lower_bound(all(a),b[i]+d)-a.begin(); while(t>=0){ if(abs(a[t]-b[i])<=d) ans=max(ans,a[t]+b[i]); t--; } } for(int i=0;i<n;i++){ int t=lower_bound(all(b),a[i]+d)-b.begin(); while(t>=0){ if(abs(b[t]-a[i])<=d) ans=max(ans,b[t]+a[i]); t--; } } if(ans==-inf) cout<<"None\n"; else cout<<ans<<endl; } int main(){ ios::sync_with_stdio(false); cin.tie(0),cout.tie(0); //freopen("pow.in","r",stdin); //freopen("pow.out","w",stdout); //init(); int t=1; //cin>>t; while(t--) O_O(); return 0; } // />  フ // | _ _ | // / ミ ^ ノ // / | // / ノ // │ | | | // / ̄    | | | // | ( ̄ヽ___ヽ_)__) // \二


Judgement Protocol: