Submission #1076689


Source Code Expand

using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Text;
using System.Text.RegularExpressions;
using System.Linq;
using System.IO;

class Program
{ 
    static void Main(string[]args)
    {
        Magatro m = new Magatro();
        m.Scan();
        m.Solve();
    }
}

public class Scanner
{
    private StreamReader Sr;
    private string[] S;
    private int Index;

    private const char Separator=' ';

    public Scanner()
    {
        Index = 0;
        S = new string[0];
        Sr = new StreamReader(Console.OpenStandardInput());
    }

    private string[] Line()
    {
        return Sr.ReadLine().Split(Separator);
    }

    public string Next()
    {
        string result;
        if (Index >= S.Length)
        {
            S = Line();
            Index = 0;
        }
        result = S[Index];
        Index++;
        return result;
    }
    public int NextInt()
    {
        return int.Parse(Next());
    }
    public double NextDouble()
    {
        return double.Parse(Next());
    }
    public long NextLong()
    {
        return long.Parse(Next());
    }
    public string[] StringArray(int index = 0)
    {
        Next();
        Index = S.Length;
        return S.Skip(index).ToArray();
    }
    public int[] IntArray(int index = 0)
    {
        return StringArray(index).Select(int.Parse).ToArray();
    }
    public long[]LongArray(int index = 0)
    {
        return StringArray(index).Select(long.Parse).ToArray();
    }

    public bool ScanToEnd(ref string s)
    {
        if (Sr.EndOfStream)
        {
            return false;
        }
        else
        {
            s = Sr.ReadLine();
            return true;
        }
    }
}

public class Magatro
{
    private int N;
    private int[] d;
    private int sum = 0;
    private int max = -1;
    public void Scan()
    {
        Scanner sc = new Scanner();
        N = sc.NextInt();
        for(int i = 0; i < N; i++)
        {
            int d = sc.NextInt();
            max = Math.Max(max, d);
            sum += d;
        }
    }

    public void Solve()
    {
        Console.WriteLine(sum);
        if (sum - max > max)
        {
            Console.WriteLine(0);
        }
        else
        {
            Console.WriteLine(max * 2 - sum);
        }
    }
}



Submission Info

Submission Time
Task B - 2点間距離の最大と最小 ( Maximum and Minimum )
User mban
Language C# (Mono 2.10.8.1)
Score 100
Code Size 2476 Byte
Status AC
Exec Time 57 ms
Memory 3700 KB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 63
Set Name Test Cases
All 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, 00_sample_05.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 02_rnd2_00.txt, 02_rnd2_01.txt, 02_rnd2_02.txt, 02_rnd2_03.txt, 02_rnd2_04.txt, 02_rnd2_05.txt, 02_rnd2_06.txt, 02_rnd2_07.txt, 02_rnd2_08.txt, 02_rnd2_09.txt, 02_rnd2_10.txt, 02_rnd2_11.txt, 02_rnd2_12.txt, 02_rnd2_13.txt, 02_rnd2_14.txt, 02_rnd2_15.txt, 02_rnd2_16.txt, 02_rnd2_17.txt, 02_rnd2_18.txt, 02_rnd2_19.txt, 02_rnd2_20.txt, 02_rnd2_21.txt, 02_rnd2_22.txt, 02_rnd2_23.txt, 02_rnd2_24.txt, 02_rnd2_25.txt, 02_rnd2_26.txt, 02_rnd2_27.txt, 02_rnd2_28.txt, 02_rnd2_29.txt, 03_max_00.txt, 03_max_01.txt, 03_max_02.txt, 03_max_03.txt, 03_max_04.txt, 03_max_05.txt, 03_max_06.txt, 03_max_07.txt, 03_max_08.txt, 03_max_09.txt, 04_maxret_01.txt, 04_maxret_02.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 54 ms 3480 KB
00_sample_02.txt AC 53 ms 3504 KB
00_sample_03.txt AC 52 ms 3552 KB
00_sample_04.txt AC 51 ms 3552 KB
00_sample_05.txt AC 52 ms 3500 KB
01_rnd_00.txt AC 53 ms 3496 KB
01_rnd_01.txt AC 53 ms 3500 KB
01_rnd_02.txt AC 51 ms 3496 KB
01_rnd_03.txt AC 54 ms 3504 KB
01_rnd_04.txt AC 53 ms 3500 KB
01_rnd_05.txt AC 54 ms 3540 KB
01_rnd_06.txt AC 55 ms 3500 KB
01_rnd_07.txt AC 53 ms 3492 KB
01_rnd_08.txt AC 54 ms 3560 KB
01_rnd_09.txt AC 54 ms 3500 KB
01_rnd_10.txt AC 52 ms 3476 KB
01_rnd_11.txt AC 53 ms 3540 KB
01_rnd_12.txt AC 53 ms 3536 KB
01_rnd_13.txt AC 53 ms 3560 KB
01_rnd_14.txt AC 54 ms 3500 KB
01_rnd_15.txt AC 53 ms 3568 KB
02_rnd2_00.txt AC 53 ms 3500 KB
02_rnd2_01.txt AC 53 ms 3500 KB
02_rnd2_02.txt AC 54 ms 3500 KB
02_rnd2_03.txt AC 53 ms 3500 KB
02_rnd2_04.txt AC 53 ms 3532 KB
02_rnd2_05.txt AC 54 ms 3556 KB
02_rnd2_06.txt AC 53 ms 3568 KB
02_rnd2_07.txt AC 53 ms 3560 KB
02_rnd2_08.txt AC 56 ms 3508 KB
02_rnd2_09.txt AC 55 ms 3500 KB
02_rnd2_10.txt AC 53 ms 3480 KB
02_rnd2_11.txt AC 53 ms 3500 KB
02_rnd2_12.txt AC 55 ms 3560 KB
02_rnd2_13.txt AC 53 ms 3480 KB
02_rnd2_14.txt AC 53 ms 3500 KB
02_rnd2_15.txt AC 53 ms 3500 KB
02_rnd2_16.txt AC 52 ms 3500 KB
02_rnd2_17.txt AC 53 ms 3476 KB
02_rnd2_18.txt AC 52 ms 3540 KB
02_rnd2_19.txt AC 53 ms 3496 KB
02_rnd2_20.txt AC 52 ms 3496 KB
02_rnd2_21.txt AC 53 ms 3548 KB
02_rnd2_22.txt AC 53 ms 3500 KB
02_rnd2_23.txt AC 51 ms 3556 KB
02_rnd2_24.txt AC 54 ms 3500 KB
02_rnd2_25.txt AC 54 ms 3500 KB
02_rnd2_26.txt AC 53 ms 3520 KB
02_rnd2_27.txt AC 52 ms 3412 KB
02_rnd2_28.txt AC 53 ms 3500 KB
02_rnd2_29.txt AC 54 ms 3500 KB
03_max_00.txt AC 55 ms 3616 KB
03_max_01.txt AC 53 ms 3588 KB
03_max_02.txt AC 55 ms 3700 KB
03_max_03.txt AC 55 ms 3688 KB
03_max_04.txt AC 57 ms 3700 KB
03_max_05.txt AC 55 ms 3644 KB
03_max_06.txt AC 53 ms 3640 KB
03_max_07.txt AC 54 ms 3620 KB
03_max_08.txt AC 53 ms 3544 KB
03_max_09.txt AC 54 ms 3684 KB
04_maxret_01.txt AC 55 ms 3680 KB
04_maxret_02.txt AC 53 ms 3528 KB