Submission #1697087
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define _rep(i,n) _repl(i,0,n)
#define rep(...) GET_MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
void _dbg(string){cout<<endl;}
template<class H,class... T> void _dbg(string s,H h,T... t){int l=s.find(',');cout<<s.substr(0,l)<<" = "<<h<<", ";_dbg(s.substr(l+1),t...);}
template<class T,class U> ostream& operator<<(ostream &o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream &o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}
#define INF 1120000000
#define long long long // for codeforces
int main(){
int n;
cin>>n;
vector<int> v(n);
rep(i,n) cin>>v[i];
sort(all(v));
vector<int> val;
rep(i,n/2) val.pb(v[i] + v[n-i-1]);
sort(all(val));
cout << val.back() - val[0] << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Table Tennis |
User |
tossy |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1221 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
00-sample-00.txt, 00-sample-01.txt, 10-unique-00.txt, 10-unique-01.txt, 10-unique-02.txt, 10-unique-03.txt, 10-unique-04.txt, 20-order-00.txt, 20-order-01.txt, 20-order-02.txt, 20-order-03.txt, 20-order-04.txt, 30-random-00.txt, 30-random-01.txt, 30-random-02.txt, 30-random-03.txt, 30-random-04.txt, 30-random-05.txt, 30-random-06.txt, 30-random-07.txt, 30-random-08.txt, 30-random-09.txt, 30-random-10.txt, 30-random-11.txt, 30-random-12.txt, 30-random-13.txt, 30-random-14.txt |
Case Name |
Status |
Exec Time |
Memory |
00-sample-00.txt |
AC |
1 ms |
256 KB |
00-sample-01.txt |
AC |
1 ms |
256 KB |
10-unique-00.txt |
AC |
1 ms |
256 KB |
10-unique-01.txt |
AC |
1 ms |
256 KB |
10-unique-02.txt |
AC |
1 ms |
256 KB |
10-unique-03.txt |
AC |
1 ms |
256 KB |
10-unique-04.txt |
AC |
1 ms |
256 KB |
20-order-00.txt |
AC |
1 ms |
256 KB |
20-order-01.txt |
AC |
1 ms |
256 KB |
20-order-02.txt |
AC |
1 ms |
256 KB |
20-order-03.txt |
AC |
1 ms |
256 KB |
20-order-04.txt |
AC |
1 ms |
256 KB |
30-random-00.txt |
AC |
1 ms |
256 KB |
30-random-01.txt |
AC |
1 ms |
256 KB |
30-random-02.txt |
AC |
1 ms |
256 KB |
30-random-03.txt |
AC |
1 ms |
256 KB |
30-random-04.txt |
AC |
1 ms |
256 KB |
30-random-05.txt |
AC |
1 ms |
256 KB |
30-random-06.txt |
AC |
1 ms |
256 KB |
30-random-07.txt |
AC |
1 ms |
256 KB |
30-random-08.txt |
AC |
1 ms |
256 KB |
30-random-09.txt |
AC |
1 ms |
256 KB |
30-random-10.txt |
AC |
1 ms |
256 KB |
30-random-11.txt |
AC |
1 ms |
256 KB |
30-random-12.txt |
AC |
1 ms |
256 KB |
30-random-13.txt |
AC |
1 ms |
256 KB |
30-random-14.txt |
AC |
1 ms |
256 KB |