Submission #1346680

#TimeUsernameProblemLanguageResultExecution timeMemory
1346680fatime_aslan_156Table Tennis (info1cup20_tabletennis)C++20
0 / 100
70 ms4644 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n;
vector<ll>c(vector<ll>&v,ll x)
{
    vector<ll>f;
    ll l=0,r=v.size()-1,e=0;
    while(l<r && e*2<n)
    {
        if(v[l]+v[r]==x)
        {
            e++;
            f.push_back(v[l]);
            f.push_back(v[r]);
            l++;
            r--;
        }
        else if(v[l]+v[r]<x)
        {
            l++;
        }
        else
        {
            r--;
        }
    }
    if(e*2<n)
    {
        vector<ll>y;
        return y;
    }
    while(f.size()>n)
    {
        f.pop_back();
        f.pop_back();
    }
    return f;
}
int main()
{
    ll k;
    cin>>n>>k;
    vector<ll>v(n+k);
    for(int i=0;i<n+k;i++)
    {
        cin>>v[i];
    }
    set<ll>s;
    for(int i=0;i<k;i++)
    {
        for(int j=n;j<n+k;j++)
        {
            if(i!=j)
            s.insert(v[i]+v[j]);
        }
    }
    for(int i:s)
    {
        vector<ll>t=c(v,i);
        if(!t.empty())
        {
            sort(t.begin(),t.end());
            for(int j:t)
            cout<<j<<' ';
            return 0;
        }
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...