Omenat

#include <iostream>
#include <algorithm>
#include <cassert>
using namespace std;
const int MN=101;
typedef long long ll;

typedef pair<int,int> P;
P ps[MN];
int vs[MN];

const int MS = 100*1000;
const int MS2 = MS/2;

bool dp[MN][MS];

int main() {
	int n;
	cin>>n;
	for(int i=0; i<n; ++i) {
		int x;
		cin>>x;
		ps[i]=P(x,i);
	}
	sort(ps,ps+n);
	for(int i=0; i<n; ++i) vs[i]=ps[i].first;

	int sum=0;
	for(int i=0; i<n; ++i) sum+=vs[i];

	assert(sum<MS2);
}

Test 1

Verdict: RUNTIME ERROR

code: input/code.cpp:31: int main(): Assertion `sum<MS2' failed.

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: RUNTIME ERROR

code: input/code.cpp:31: int main(): Assertion `sum<MS2' failed.

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: RUNTIME ERROR

code: input/code.cpp:31: int main(): Assertion `sum<MS2' failed.

Test 6

Verdict: RUNTIME ERROR

code: input/code.cpp:31: int main(): Assertion `sum<MS2' failed.

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: RUNTIME ERROR

code: input/code.cpp:31: int main(): Assertion `sum<MS2' failed.

Test 10

Verdict: RUNTIME ERROR

code: input/code.cpp:31: int main(): Assertion `sum<MS2' failed.