Submission #239064

#	Time	Username	Problem	Language	Result	Execution time	Memory
239064		Vimmer	Vrtić (COCI18_vrtic)	C++14	32 / 160	5 ms	384 KiB

vrtic

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 101001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;




bool mk[N];

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    int a[n];

    for (int i = 0; i < n; i++) cin >> a[i];

    for (int i = 0; i < n; i++) cin >> a[i];

    sort(a, a + n);

    ll ans = 0;

    vector <ll> g; g.clear();

    for (int i = 0; i < n; i += 2)
    {
        mk[i] =1;

        g.pb(a[i]);
    }

    for (int i = n - 1; i >= 0; i--) if (!mk[i]) g.pb(a[i]);

    ll val = g.back();

    for (auto it : g)
    {
        ans = max(ans, abs(val - it));

        val = it;
    }
    cout << ans << endl;

    for (auto it : g) cout << it << " ";
}

• Subtask 1: 16 / 16
• Subtask 2: 16 / 16
• Subtask 3: 0 / 16
• Subtask 4: 0 / 16
• Subtask 5: 0 / 16
• Subtask 6: 0 / 16
• Subtask 7: 0 / 16
• Subtask 8: 0 / 16
• Subtask 9: 0 / 16
• Subtask 10: 0 / 16