#include <bits/stdc++.h>
using namespace std;
const int nx=2e5+5, kx=405;
int n, k, vl[nx];
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>n>>k;
for (int i=1; i<=n ;i++) cin>>vl[i];
for (int i=1; i<=n; i++)
{
vector<int> v;
set<int> s;
for (int j=1; j<=n; j++) if (i!=j) v.push_back(vl[i]);
sort(v.begin(), v.end());
for (int i=0; (int)v.size()-1-i>i; i++) s.insert(v[i]+v[v.size()-1-i]);
if (s.size()==1)
{
for (auto x:v) cout<<x<<' ';
return 0;
}
}
}
# | 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... |