Submission #3473124


Source Code Expand

#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int f[10000],n,maxn=0,sum=0;
int max(int a,int b){return a>b?a:b;}
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
    	scanf("%d",f[i]);
    	maxn=max(maxn,f[i]);sum+=f[i];
	}
	printf("%d\n",sum);
	sum-=maxn;
	if(maxn<sum) printf("0\n");
	else printf("%d\n",maxn-sum);
    return 0;
}

Submission Info

Submission Time
Task B - 2点間距離の最大と最小 ( Maximum and Minimum )
User luogu_bot1
Language C++ (GCC 5.4.1)
Score 0
Code Size 434 Byte
Status RE
Exec Time 99 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:14:21: warning: format ‘%d’ expects argument of type ‘int*’, but argument 2 has type ‘int’ [-Wformat=]
      scanf("%d",f[i]);
                     ^
./Main.cpp:11:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
./Main.cpp:14:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
      scanf("%d",f[i]);
                      ^

Judge Result

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