# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
424453 | jamezzz | Table Tennis (info1cup20_tabletennis) | C++17 | 51 ms | 4548 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 sf scanf
#define pf printf
#define fi first
#define se second
#define pb emplace_back
#define all(x) x.begin(),x.end()
int n,k,v;
vector<int> s,ans;
map<int,int> cnt;
int main(){
sf("%d%d",&n,&k);
n+=k;
for(int i=0;i<n;++i){
sf("%d",&v);
s.push_back(v);
}
sort(all(s));
for(int i=0;i<min(2*k,n);++i){
for(int j=max(0,n-2*k);j<n;++j){
if(i==j)continue;
cnt[s[i]+s[j]]+=1;
}
}
int res=0;
for(auto it:cnt){
if(it.se>=k){
res=it.fi;break;
}
}
int cr=n-1;
for(int i=0;i<n;++i){
if(s[i]>=res-s[i])break;
while(res-s[i]<s[cr])--cr;
if(res-s[i]==s[cr]){
ans.pb(s[i]);
ans.pb(res-s[i]);
--cr;
}
if(ans.size()==n-k)break;
}
sort(all(ans));
for(int x:ans)pf("%d ",x);
pf("\n");
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |