Submission #1358117
Source Code Expand
#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<string> #include<stack> #include<queue> #include<vector> #include<algorithm> #include<iomanip> typedef long long int ll; using namespace std; #define FOR(i,a,b) for (int i=(a);i<(b);i++) #define REP(i,n) for (int i=0;i<(n);i++) #define EREP(i,n) for (int i=1;i<=(n);i++) #define ALL(a) (a).begin(),(a).end() #define EVEL 1 #ifndef EVEL #define DEB(X) cout << #X << ":" <<X<<" " ; #define TF(f) f ? cout<<"true " : cout<<"false "; #define END cout<<"\n"; #else #define DEB(X) {} #define TF(f) {} #define END {} #endif const int MOD = 1000000007; const int INF = 2000000000; ll A,B,C; int N,M,K,X,Y,W,H; ll ans; string S; ll a[100010]; int temp[100]={0}; bool f=false; bool fir=true; ll sum[10000]; int main(){ cin>>N; A=-INF;B=INF; REP(i,N)cin>>a[i]; sort(a,a+N); REP(i,N/2){ sum[i]=a[i]+a[N-1-i]; } REP(i,N/2){ A=max(sum[i],A); B=min(sum[i],B); } cout<<A-B<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - Table Tennis |
User | Nafmo2 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1118 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 |