# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
373230 | ahmedfouadnew | Table Tennis (info1cup20_tabletennis) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define s second
#define f first
#define pb push_back
#define int long long
#define double long double
int n,k;
int a[200005];
unordered_map<int,int>mp;
int mx,mxi;
void fun(int ii,int s,int e)
{
e=min(e,n+k-1);
s=max(0ll,s);
for(int i=s;i<=e;i++)
{
if(i==ii) continue;
mp[a[ii]+a[i]]++;
if(mp[a[ii]+a[i]]>mx)
{
mx=mp[a[ii]+a[i]];
mxi=a[ii]+a[i];
}
}
}
signed main()
{
cin>>n>>k;
for(int i=0;i<n+k;i++)
{
cin>>a[i];
}
sort(a,a+n+k);
for(int i=0;i<n+k;i++)
{
fun(a[i],(n+k-1-i)-k,(n+k-1-i)+k);
}
vector<int>ans;
int cnt=n;
int e=n+k-1;
for(int i=0;i<n+k;i++)
{
int cur=e;
bool ok=0;
while(e-cur<=k)
{
if(a[i]+a[cur]==mxi)
{
ok=1;
ans.pb(a[i]);
ans.pb(a[cur]);
break;
}
cur--;
}
if(ok)
{
cnt-=2;
e=cur-1;
}
if(cnt==0) break;
}
sort(ans.begin(),ans.end());
for(int i=0;i<ans.size();i++)
{
cout<<ans[i]<<" \n"[i+1==ans.size()];
}
return 0;
}
#include<bits/stdc++.h>
using namespace std;
#define s second
#define f first
#define pb push_back
#define int long long
#define double long double
int n,k;
int a[200005];
unordered_map<int,int>mp;
int mx,mxi;
void fun(int ii,int s,int e)
{
e=min(e,n+k-1);
s=max(0ll,s);
for(int i=s;i<=e;i++)
{
if(i==ii) continue;
mp[a[ii]+a[i]]++;
if(mp[a[ii]+a[i]]>mx)
{
mx=mp[a[ii]+a[i]];
mxi=a[ii]+a[i];
}
}
}
signed main()
{
cin>>n>>k;
for(int i=0;i<n+k;i++)
{
cin>>a[i];
}
sort(a,a+n+k);
for(int i=0;i<n+k;i++)
{
fun(a[i],(n+k-1-i)-k,(n+k-1-i)+k);
}
vector<int>ans;
int cnt=n;
int e=n+k-1;
for(int i=0;i<n+k;i++)
{
int cur=e;
bool ok=0;
while(e-cur<=k)
{
if(a[i]+a[cur]==mxi)
{
ok=1;
ans.pb(a[i]);
ans.pb(a[cur]);
break;
}
cur--;
}
if(ok)
{
cnt-=2;
e=cur-1;
}
if(cnt==0) break;
}
sort(ans.begin(),ans.end());
for(int i=0;i<ans.size();i++)
{
cout<<ans[i]<<" \n"[i+1==ans.size()];
}
return 0;
}