Submission #477353


Source Code Expand

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.Numerics;

namespace Solver
{
    class Program
    {
        const long M = 1000000007;
        const double eps = 10e-9;
        static void Main()
        {
            var sw = new System.IO.StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            var sc = new Scan();
            int n = sc.Int;
            int max = 0, sum = 0;
            for (int i = 0; i < n; i++)
            {
                int d = sc.Int;
                max = Math.Max(max, d);
                sum += d;
            }
            sw.WriteLine(sum);
            if (max * 2 < sum)
                sw.WriteLine(0);
            else
                sw.WriteLine(max * 2 - sum);

            sw.Flush();
        }
    }
    class Scan
    {
        public int Int { get { return int.Parse(Console.ReadLine().Trim()); } }
        public long Long { get { return long.Parse(Console.ReadLine().Trim()); } }
        public string Str { get { return Console.ReadLine().Trim(); } }
        public int[] IntArr { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToArray(); } }
        public int[] IntArrWithSep(char sep) {  return Console.ReadLine().Trim().Split(sep).Select(int.Parse).ToArray(); }
        public long[] LongArr { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToArray(); } }
        public double[] DoubleArr { get { return Console.ReadLine().Split().Select(double.Parse).ToArray(); } }
        public string[] StrArr { get { return Console.ReadLine().Trim().Split(); } }
        public List<int> IntList { get { return Console.ReadLine().Trim().Split().Select(int.Parse).ToList(); } }
        public List<long> LongList { get { return Console.ReadLine().Trim().Split().Select(long.Parse).ToList(); } }
        public void Multi(out int a, out int b) { var arr = IntArr; a = arr[0]; b = arr[1]; }
        public void Multi(out int a, out int b, out int c) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; }
        public void Multi(out int a, out int b, out int c, out int d) { var arr = IntArr; a = arr[0]; b = arr[1]; c = arr[2]; d = arr[3]; }
        public void Multi(out int a, out string b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1]; }
        public void Multi(out int a, out char b) { var arr = StrArr; a = int.Parse(arr[0]); b = arr[1][0]; }
        public void Multi(out long a, out long b) { var arr = LongArr; a = arr[0]; b = arr[1]; }
        public void Multi(out string a, out string b) { var arr = StrArr; a = arr[0]; b = arr[1]; }
    }
}

Submission Info

Submission Time
Task B - 2点間距離の最大と最小 ( Maximum and Minimum )
User riantkb
Language C# (Mono 2.10.8.1)
Score 100
Code Size 2692 Byte
Status AC
Exec Time 135 ms
Memory 7816 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 133 ms 7772 KB
00_sample_02.txt AC 131 ms 7736 KB
00_sample_03.txt AC 130 ms 7732 KB
00_sample_04.txt AC 128 ms 7764 KB
00_sample_05.txt AC 128 ms 7732 KB
01_rnd_00.txt AC 129 ms 7728 KB
01_rnd_01.txt AC 128 ms 7724 KB
01_rnd_02.txt AC 131 ms 7796 KB
01_rnd_03.txt AC 128 ms 7720 KB
01_rnd_04.txt AC 127 ms 7796 KB
01_rnd_05.txt AC 130 ms 7800 KB
01_rnd_06.txt AC 129 ms 7712 KB
01_rnd_07.txt AC 126 ms 7800 KB
01_rnd_08.txt AC 133 ms 7736 KB
01_rnd_09.txt AC 131 ms 7800 KB
01_rnd_10.txt AC 126 ms 7736 KB
01_rnd_11.txt AC 126 ms 7736 KB
01_rnd_12.txt AC 130 ms 7740 KB
01_rnd_13.txt AC 129 ms 7736 KB
01_rnd_14.txt AC 132 ms 7736 KB
01_rnd_15.txt AC 135 ms 7736 KB
02_rnd2_00.txt AC 128 ms 7796 KB
02_rnd2_01.txt AC 128 ms 7768 KB
02_rnd2_02.txt AC 130 ms 7732 KB
02_rnd2_03.txt AC 128 ms 7804 KB
02_rnd2_04.txt AC 126 ms 7784 KB
02_rnd2_05.txt AC 128 ms 7816 KB
02_rnd2_06.txt AC 128 ms 7800 KB
02_rnd2_07.txt AC 131 ms 7704 KB
02_rnd2_08.txt AC 132 ms 7736 KB
02_rnd2_09.txt AC 129 ms 7736 KB
02_rnd2_10.txt AC 132 ms 7732 KB
02_rnd2_11.txt AC 127 ms 7800 KB
02_rnd2_12.txt AC 125 ms 7736 KB
02_rnd2_13.txt AC 125 ms 7776 KB
02_rnd2_14.txt AC 125 ms 7736 KB
02_rnd2_15.txt AC 128 ms 7736 KB
02_rnd2_16.txt AC 132 ms 7736 KB
02_rnd2_17.txt AC 131 ms 7736 KB
02_rnd2_18.txt AC 130 ms 7732 KB
02_rnd2_19.txt AC 130 ms 7796 KB
02_rnd2_20.txt AC 130 ms 7764 KB
02_rnd2_21.txt AC 127 ms 7796 KB
02_rnd2_22.txt AC 128 ms 7792 KB
02_rnd2_23.txt AC 126 ms 7808 KB
02_rnd2_24.txt AC 128 ms 7760 KB
02_rnd2_25.txt AC 131 ms 7736 KB
02_rnd2_26.txt AC 130 ms 7732 KB
02_rnd2_27.txt AC 128 ms 7800 KB
02_rnd2_28.txt AC 131 ms 7716 KB
02_rnd2_29.txt AC 127 ms 7736 KB
03_max_00.txt AC 129 ms 7804 KB
03_max_01.txt AC 129 ms 7804 KB
03_max_02.txt AC 132 ms 7792 KB
03_max_03.txt AC 128 ms 7728 KB
03_max_04.txt AC 129 ms 7804 KB
03_max_05.txt AC 134 ms 7760 KB
03_max_06.txt AC 127 ms 7784 KB
03_max_07.txt AC 129 ms 7780 KB
03_max_08.txt AC 127 ms 7800 KB
03_max_09.txt AC 127 ms 7800 KB
04_maxret_01.txt AC 130 ms 7800 KB
04_maxret_02.txt AC 128 ms 7808 KB