Submission #1476088


Source Code Expand

Copy
#include <stdio.h>

int main(){
	int N, d, i, maxd = 0, sum = 0;
	scanf("%d", &N);
	for(i = 0; i < N; i++){
		scanf("%d", &d);
		if(d > maxd){
			maxd = d;
		}
		sum += d;
	}
	printf("%d\n", sum);
	if(2 * maxd <= sum){
		printf("0\n");
	}
	else{
		printf("%d\n", 2 * maxd - sum);
	}
	return 0;
}

Submission Info

Submission Time
Task B - 2点間距離の最大と最小 ( Maximum and Minimum )
User abc050
Language C (GCC 5.4.1)
Score 100
Code Size 315 Byte
Status
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.c: In function ‘main’:
./Main.c:5:2: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ^
./Main.c:7:3: warning: ignoring return value of ‘scanf’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &d);
   ^

Judge Result

Set Name Score / Max Score Test Cases
All 100 / 100 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 0 ms 128 KB
00_sample_02.txt 0 ms 128 KB
00_sample_03.txt 0 ms 128 KB
00_sample_04.txt 0 ms 128 KB
00_sample_05.txt 0 ms 128 KB
01_rnd_00.txt 0 ms 128 KB
01_rnd_01.txt 0 ms 128 KB
01_rnd_02.txt 0 ms 128 KB
01_rnd_03.txt 0 ms 128 KB
01_rnd_04.txt 0 ms 128 KB
01_rnd_05.txt 0 ms 128 KB
01_rnd_06.txt 0 ms 128 KB
01_rnd_07.txt 0 ms 128 KB
01_rnd_08.txt 0 ms 128 KB
01_rnd_09.txt 1 ms 128 KB
01_rnd_10.txt 0 ms 128 KB
01_rnd_11.txt 0 ms 128 KB
01_rnd_12.txt 1 ms 128 KB
01_rnd_13.txt 0 ms 128 KB
01_rnd_14.txt 1 ms 128 KB
01_rnd_15.txt 0 ms 128 KB
02_rnd2_00.txt 0 ms 128 KB
02_rnd2_01.txt 0 ms 128 KB
02_rnd2_02.txt 0 ms 128 KB
02_rnd2_03.txt 0 ms 128 KB
02_rnd2_04.txt 0 ms 128 KB
02_rnd2_05.txt 0 ms 128 KB
02_rnd2_06.txt 0 ms 128 KB
02_rnd2_07.txt 0 ms 128 KB
02_rnd2_08.txt 0 ms 128 KB
02_rnd2_09.txt 0 ms 128 KB
02_rnd2_10.txt 0 ms 128 KB
02_rnd2_11.txt 0 ms 128 KB
02_rnd2_12.txt 0 ms 128 KB
02_rnd2_13.txt 0 ms 128 KB
02_rnd2_14.txt 0 ms 128 KB
02_rnd2_15.txt 1 ms 128 KB
02_rnd2_16.txt 0 ms 128 KB
02_rnd2_17.txt 0 ms 128 KB
02_rnd2_18.txt 0 ms 128 KB
02_rnd2_19.txt 0 ms 128 KB
02_rnd2_20.txt 0 ms 128 KB
02_rnd2_21.txt 0 ms 128 KB
02_rnd2_22.txt 1 ms 128 KB
02_rnd2_23.txt 0 ms 128 KB
02_rnd2_24.txt 0 ms 128 KB
02_rnd2_25.txt 0 ms 128 KB
02_rnd2_26.txt 0 ms 128 KB
02_rnd2_27.txt 1 ms 128 KB
02_rnd2_28.txt 0 ms 128 KB
02_rnd2_29.txt 0 ms 128 KB
03_max_00.txt 1 ms 128 KB
03_max_01.txt 1 ms 128 KB
03_max_02.txt 1 ms 128 KB
03_max_03.txt 1 ms 128 KB
03_max_04.txt 1 ms 128 KB
03_max_05.txt 1 ms 128 KB
03_max_06.txt 1 ms 128 KB
03_max_07.txt 1 ms 128 KB
03_max_08.txt 1 ms 128 KB
03_max_09.txt 1 ms 128 KB
04_maxret_01.txt 1 ms 128 KB
04_maxret_02.txt 0 ms 128 KB