제출 #287514

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
287514		FlashGamezzz	Kas (COCI17_kas)	C++17	0 / 100	165 ms	88440 KiB

kas

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <string>
#include <utility>
#include <vector>

using namespace std;

bool dpf[501][100001] = {}, dpb[501][100001] = {};
int n;
long sum, notes[500];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> n;
	for (int i = 0; i < n; i++){
		cin >> notes[i];
		sum += notes[i];
	}
	dpf[0][0] = true;
	for (int i = 1; i <= n; i++){
		for (long j = 0; j < 100001; j++){
			dpf[i][j] = dpf[i-1][j];
			if (j >= notes[i-1]){
				dpf[i][j] = dpf[i][j] || dpf[i-1][j-notes[i-1]];
			}
		}
	}
	dpb[n][0] = true;
	for (int i = n-1; i >= 0; i--){
		for (long j = 0; j < 100001; j++){
			dpb[i][j] = dpb[i+1][j];
			if (j >= notes[i]){
				dpb[i][j] = dpb[i][j] || dpb[i+1][j-notes[i]];
			}
		}
	}
	long me = 0;
	for (int i = 0; i <= n; i++){
		for (long j = 0; j < 10001; j++){
			if (dpf[i][j] && dpb[i][j]){
				me = max(me, j);
			}
		}
	}
	cout << sum-me << endl;
}

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