Submission #935906
Source Code Expand
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <sstream>
#include <cmath>
#include <set>
#include <iomanip>
#include <deque>
#include <stdio.h>
using namespace std;
#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define RREP(i,n) for(int (i)=(int)(n)-1;i>=0;i--)
#define iREP(i,Itr) for(auto (i)=(Itr).begin();(i)!=(Itr).end();(i)++)
#define REMOVE(Itr,n) (Itr).erase(remove((Itr).begin(),(Itr).end(),n),(Itr).end())
#define PB_VEC(Itr1,Itr2) (Itr1).insert((Itr1).end(),(Itr2).begin(),(Itr2).end())
#define UNIQUE(Itr) sort((Itr).begin(),(Itr).end()); (Itr).erase(unique((Itr).begin(),(Itr).end()),(Itr).end())
#define LBOUND(Itr,val) lower_bound((Itr).begin(),(Itr).end(),(val))
#define UBOUND(Itr,val) upper_bound((Itr).begin(),(Itr).end(),(val))
typedef long long ll;
int main(){
int n; cin>>n;
vector<int> a(n);
REP(i,n)cin>>a[i];
sort(a.begin(),a.end());
int maxa=-1,mina=1e9;
REP(i,a.size()/2){
maxa=max(maxa,a[i]+a[a.size()-1-i]);
mina=min(mina,a[i]+a[a.size()-1-i]);
}
cout<<abs(mina-maxa)<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Table Tennis |
User |
kosakkun |
Language |
C++ (GCC 4.9.2) |
Score |
100 |
Code Size |
1229 Byte |
Status |
AC |
Exec Time |
22 ms |
Memory |
924 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 |
20 ms |
920 KB |
00-sample-01.txt |
AC |
20 ms |
920 KB |
10-unique-00.txt |
AC |
20 ms |
916 KB |
10-unique-01.txt |
AC |
20 ms |
804 KB |
10-unique-02.txt |
AC |
22 ms |
924 KB |
10-unique-03.txt |
AC |
19 ms |
924 KB |
10-unique-04.txt |
AC |
20 ms |
920 KB |
20-order-00.txt |
AC |
21 ms |
924 KB |
20-order-01.txt |
AC |
22 ms |
920 KB |
20-order-02.txt |
AC |
21 ms |
924 KB |
20-order-03.txt |
AC |
19 ms |
920 KB |
20-order-04.txt |
AC |
20 ms |
924 KB |
30-random-00.txt |
AC |
20 ms |
804 KB |
30-random-01.txt |
AC |
21 ms |
920 KB |
30-random-02.txt |
AC |
21 ms |
924 KB |
30-random-03.txt |
AC |
22 ms |
924 KB |
30-random-04.txt |
AC |
19 ms |
920 KB |
30-random-05.txt |
AC |
21 ms |
924 KB |
30-random-06.txt |
AC |
20 ms |
920 KB |
30-random-07.txt |
AC |
22 ms |
796 KB |
30-random-08.txt |
AC |
20 ms |
924 KB |
30-random-09.txt |
AC |
22 ms |
916 KB |
30-random-10.txt |
AC |
20 ms |
920 KB |
30-random-11.txt |
AC |
20 ms |
920 KB |
30-random-12.txt |
AC |
20 ms |
916 KB |
30-random-13.txt |
AC |
20 ms |
920 KB |
30-random-14.txt |
AC |
20 ms |
920 KB |