Submission #994029

#	Time	Username	Problem	Language	Result	Execution time	Memory
994029		vjudge1	Kas (COCI17_kas)	C++17	70 / 100	104 ms	6224 KiB

kas

#include <bits/stdc++.h>
using namespace std;

#define ll long long
int const N=2005;
int const mod=1e9+7;

bool have[N][N];

void solve(){
	int n;
	cin>>n;
	have[0][0]=1;
	int sm=0;
	for(int e=0;e<n;e++){
		int c;
		cin>>c;
		sm+=c;
		for(int i=500;i>=0;i--)
			for(int j=500;j>=0;j--)
				if(have[i][j]){
					have[i+c][j]=1;
					have[i][j+c]=1;
				}
	}
	// cout<<sm<<endl;
	for(int i=500;i>=0;i--)
		if(have[i][i]){
			cout<<sm-i<<endl;
			return;
		}
}

int main(){
	int t=1;
	// cin>>t;
	while(t--)
		solve();
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10