Submission #1713879


Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <fstream>
#include <sstream>
#include <set>
#include <map>
#include <vector>
#include <list>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <string>
#include <queue>
#include <bitset>     //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic
#include <cassert>
#include <iomanip>        //do setprecision
#include <ctime>
#include <complex>
using namespace std;
  
#define FOR(i,b,e) for(int i=(b);i<(e);++i)
#define FORQ(i,b,e) for(int i=(b);i<=(e);++i)
#define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i)
#define REP(x, n) for(int x = 0; x < (n); ++x)
  
#define ST first
#define ND second
#define PB push_back
#define MP make_pair
#define LL long long
#define ULL unsigned LL
#define LD long double
  
const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342;
  
  
int main(){
	int n,m,min=10000,max=0;
	int a[101]={};
	cin>>n;
	FOR(i,0,n){
		cin>>a[i];
	}
	sort(a,a+n);
	FORQ(i,1,n/2){
		m=a[i-1]+a[n-i];
		if(m>max)max=m;
		if(m<min)min=m;
	}
	cout<<max-min<<endl;
	
	
    return 0;
}

Submission Info

Submission Time
Task A - Table Tennis
User kt_tenel
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1212 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 27
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