| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 320013 | xiang | 最大的和 T5 | C++ | Compile Error | 0 MS | 0 KB | 491 | 2026-05-02 15:13:13 |
#include<bits/stdc++.h> using namespace std; int main(){ const int N=20010; int a[N],b[N],n,d; cin>>n>>d; for(int i=1;i<=n;i++){ cin>>a[i]; } for(int i=1;i<=n;i++){ cin>>b[i] } sort(a+1,a+n+1); sort(b+1,b+n+1); int i=n,j=n; while(abs(a[i]-b[j]>d){ if(a[i]>b[j]){ i--; } else{ j--; } } if(i<1||j<1)cout<<"None"; else cout<<a[i]+b[j]; return 0; }