# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
667609 | eric | Table Tennis (info1cup20_tabletennis) | C++14 | 40 ms | 2892 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;
int main()
{
int n, k, wrong;
scanf("%d %d", &n, &k);
long long int v[n + k], som = 0;
for(int i = 0; i < n + k; i++){
scanf("%lld", &v[i]);
som += v[i];
}
for(int i = 0; i < n + k; i++){
long long int m = (som - v[i])*2;
if(m%n != 0){
//printf("%d %d\n", som, v[i]);
continue;
}
m /= n;
long long int comp;
if(i == 0)comp = v[1] + v[n + k - 1];
else if(i == n + k - 1)comp = v[0] + v[n + k - 2];
else comp = v[0] + v[n + k - 1];
//printf("%f %f\n", m, comp);
if(m == comp){
wrong = v[i];
break;
}
}
//sort(v, v + (n + k));
for(int i = 0; i < n + k; i++){
if(v[i] == wrong)continue;
printf("%d ", v[i]);
}
}
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... |