Submission #23103


Source Code Expand

#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
	int num;
	scanf("%d",&num);
	int sum=0;
	int las=0;
	for(int i=0;i<num;i++)
	{
		int zan;
		scanf("%d",&zan);
		sum+=zan;
		las=max(las,zan);
	}
	printf("%d\n",sum);
	printf("%d\n",max(0,las-(sum-las)));
}

Submission Info

Submission Time
Task B - 2点間距離の最大と最小 ( Maximum and Minimum )
User DEGwer
Language C++ (G++ 4.6.4)
Score 100
Code Size 314 Byte
Status AC
Exec Time 21 ms
Memory 732 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:8:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:14:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

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 20 ms 696 KB
00_sample_02.txt AC 20 ms 696 KB
00_sample_03.txt AC 20 ms 688 KB
00_sample_04.txt AC 20 ms 664 KB
00_sample_05.txt AC 18 ms 664 KB
01_rnd_00.txt AC 20 ms 692 KB
01_rnd_01.txt AC 19 ms 668 KB
01_rnd_02.txt AC 20 ms 680 KB
01_rnd_03.txt AC 19 ms 688 KB
01_rnd_04.txt AC 19 ms 696 KB
01_rnd_05.txt AC 20 ms 676 KB
01_rnd_06.txt AC 21 ms 692 KB
01_rnd_07.txt AC 19 ms 660 KB
01_rnd_08.txt AC 18 ms 676 KB
01_rnd_09.txt AC 18 ms 660 KB
01_rnd_10.txt AC 20 ms 684 KB
01_rnd_11.txt AC 20 ms 684 KB
01_rnd_12.txt AC 21 ms 688 KB
01_rnd_13.txt AC 19 ms 668 KB
01_rnd_14.txt AC 20 ms 684 KB
01_rnd_15.txt AC 19 ms 688 KB
02_rnd2_00.txt AC 19 ms 664 KB
02_rnd2_01.txt AC 18 ms 688 KB
02_rnd2_02.txt AC 19 ms 688 KB
02_rnd2_03.txt AC 20 ms 660 KB
02_rnd2_04.txt AC 19 ms 688 KB
02_rnd2_05.txt AC 18 ms 672 KB
02_rnd2_06.txt AC 20 ms 732 KB
02_rnd2_07.txt AC 19 ms 664 KB
02_rnd2_08.txt AC 18 ms 680 KB
02_rnd2_09.txt AC 19 ms 668 KB
02_rnd2_10.txt AC 19 ms 668 KB
02_rnd2_11.txt AC 21 ms 696 KB
02_rnd2_12.txt AC 20 ms 692 KB
02_rnd2_13.txt AC 18 ms 660 KB
02_rnd2_14.txt AC 20 ms 684 KB
02_rnd2_15.txt AC 21 ms 684 KB
02_rnd2_16.txt AC 19 ms 692 KB
02_rnd2_17.txt AC 20 ms 696 KB
02_rnd2_18.txt AC 18 ms 660 KB
02_rnd2_19.txt AC 18 ms 660 KB
02_rnd2_20.txt AC 20 ms 692 KB
02_rnd2_21.txt AC 18 ms 660 KB
02_rnd2_22.txt AC 19 ms 684 KB
02_rnd2_23.txt AC 21 ms 688 KB
02_rnd2_24.txt AC 20 ms 664 KB
02_rnd2_25.txt AC 19 ms 684 KB
02_rnd2_26.txt AC 19 ms 684 KB
02_rnd2_27.txt AC 20 ms 688 KB
02_rnd2_28.txt AC 21 ms 664 KB
02_rnd2_29.txt AC 19 ms 660 KB
03_max_00.txt AC 20 ms 668 KB
03_max_01.txt AC 20 ms 668 KB
03_max_02.txt AC 19 ms 660 KB
03_max_03.txt AC 21 ms 664 KB
03_max_04.txt AC 20 ms 676 KB
03_max_05.txt AC 19 ms 660 KB
03_max_06.txt AC 19 ms 676 KB
03_max_07.txt AC 20 ms 684 KB
03_max_08.txt AC 21 ms 692 KB
03_max_09.txt AC 20 ms 660 KB
04_maxret_01.txt AC 18 ms 664 KB
04_maxret_02.txt AC 18 ms 664 KB