Submission #717405

#TimeUsernameProblemLanguageResultExecution timeMemory
717405vjudge1Table Tennis (info1cup20_tabletennis)C++98
29 / 100
30 ms2388 KiB
#include <bits/stdc++.h>
#define ll long long
#define endl '\n'
using namespace std;
// made by Jassar Alqahtani

int main()
{
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int n,k;
    cin >> n >> k;
    int a[n + 1];
    for (int i=0; n>=i; i++)
    {
        cin >> a[i];
    }
    sort(a , a + n + 1);
    for (int i=1; n>=i; i++)
    {
        int u = a[1] + a[n];
        bool f = 0;
        for (int j=1; n/2>=j; j++)
        {
            if (u != a[j] + a[n - j + 1])
            {
                f = 1;
                break;
            }
        }
        if (f == 0)
            break;
        else
            swap(a[i] , a[0]);
    }
    for (int i=1; n>=i; i++)
    {
        cout << a[i];
        if (i == n)
            cout << endl;
        else
            cout << " ";
    }
    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...