Submission #1129206


Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

int a[110];

int main(void){
    // Here your code !
    int n;
    cin >> n;
    for(int i = 0; i < n; i++) cin >> a[i];
    
    sort(a,a+n);
    
    cout << abs( (a[n-1]+a[0])-(a[n-2]+a[1]) ) << endl;
}

Submission Info

Submission Time
Task A - Table Tennis
User nasatame
Language C++14 (GCC 5.4.1)
Score 0
Code Size 286 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 14
WA × 13
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 WA 1 ms 256 KB
30-random-02.txt AC 1 ms 256 KB
30-random-03.txt WA 1 ms 256 KB
30-random-04.txt WA 1 ms 256 KB
30-random-05.txt WA 1 ms 256 KB
30-random-06.txt WA 1 ms 256 KB
30-random-07.txt WA 1 ms 256 KB
30-random-08.txt WA 1 ms 256 KB
30-random-09.txt WA 1 ms 256 KB
30-random-10.txt WA 1 ms 256 KB
30-random-11.txt WA 1 ms 256 KB
30-random-12.txt WA 1 ms 256 KB
30-random-13.txt WA 1 ms 256 KB
30-random-14.txt WA 1 ms 256 KB