Submission #45846008


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

int n, x;
int a[110], b[110];
int main() {
	scanf("%d%d", &n, &x);
	for (int i = 1; i <= n - 1; i++) {
		scanf("%d", &a[i]);
	}
	for (int i = 0; i <= 100; i++) {
		memcpy(b, a, sizeof(a));
		b[n] = i;
		sort(b + 1, b + n + 1);
		int s = 0;
		for (int j = 2; j < n; j++) {
			s += b[j];
		}
		if (s >= x) {
			printf("%d", i);
			return 0;
		}
	}
	printf("-1");
	return 0;
}

Submission Info

Submission Time
Task B - Cutoff
User yhx0322
Language C++ 20 (gcc 12.2)
Score 200
Code Size 447 Byte
Status AC
Exec Time 1 ms
Memory 3928 KiB

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:8:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
    8 |         scanf("%d%d", &n, &x);
      |         ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:10:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   10 |                 scanf("%d", &a[i]);
      |                 ~~~~~^~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 4
AC × 46
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 3724 KiB
sample_02.txt AC 1 ms 3668 KiB
sample_03.txt AC 1 ms 3644 KiB
sample_04.txt AC 1 ms 3668 KiB
test_01.txt AC 1 ms 3780 KiB
test_02.txt AC 1 ms 3788 KiB
test_03.txt AC 1 ms 3648 KiB
test_04.txt AC 1 ms 3720 KiB
test_05.txt AC 1 ms 3792 KiB
test_06.txt AC 1 ms 3712 KiB
test_07.txt AC 1 ms 3856 KiB
test_08.txt AC 1 ms 3784 KiB
test_09.txt AC 1 ms 3540 KiB
test_10.txt AC 1 ms 3796 KiB
test_11.txt AC 1 ms 3692 KiB
test_12.txt AC 1 ms 3728 KiB
test_13.txt AC 1 ms 3712 KiB
test_14.txt AC 1 ms 3784 KiB
test_15.txt AC 1 ms 3792 KiB
test_16.txt AC 1 ms 3664 KiB
test_17.txt AC 1 ms 3928 KiB
test_18.txt AC 1 ms 3664 KiB
test_19.txt AC 1 ms 3924 KiB
test_20.txt AC 1 ms 3920 KiB
test_21.txt AC 1 ms 3848 KiB
test_22.txt AC 1 ms 3672 KiB
test_23.txt AC 1 ms 3788 KiB
test_24.txt AC 1 ms 3852 KiB
test_25.txt AC 1 ms 3708 KiB
test_26.txt AC 1 ms 3724 KiB
test_27.txt AC 1 ms 3924 KiB
test_28.txt AC 1 ms 3780 KiB
test_29.txt AC 1 ms 3728 KiB
test_30.txt AC 1 ms 3800 KiB
test_31.txt AC 1 ms 3856 KiB
test_32.txt AC 1 ms 3900 KiB
test_33.txt AC 1 ms 3712 KiB
test_34.txt AC 1 ms 3800 KiB
test_35.txt AC 1 ms 3720 KiB
test_36.txt AC 1 ms 3688 KiB
test_37.txt AC 1 ms 3792 KiB
test_38.txt AC 1 ms 3852 KiB
test_39.txt AC 1 ms 3928 KiB
test_40.txt AC 1 ms 3724 KiB
test_41.txt AC 1 ms 3736 KiB
test_42.txt AC 1 ms 3800 KiB