제출 #341183

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
341183		amunduzbaev	K개의 묶음 (IZhO14_blocks)	C++14	18 / 100	1094 ms	364 KiB

blocks

/** made by amunduzbaev **/
 
#include <bits/stdc++.h>
using namespace std;
 
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
#define ll long long
#define int long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(),x.rend()
#define fastios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define vll vector<ll>
#define vii vector<int>
#define vpii vector<pii>
#define vpll vector<pll>
#define cnt(a)__builtin_popcount(a)
template<class T> bool umin(T& a, const T& b) {return a > b? a = b, true:false;}
template<class T> bool umax(T& a, const T& b) {return a < b? a = b, true:false;}
 
const int N = 100;
const int mod = 1e9+7;
const ll inf = 1e18;
const ld Pi = acos(-1);

int s, n, m, k, ans = inf, a[N];

void find(int c, int l, int sum){
	//cout<<c<<" "<<l<<" "<<sum<<endl;	
	if(c == k && l == n) { umin(ans, sum); return; }
	int mx = 0;
	for(int i=l;i<n;i++){
		//if(n-(i+1) < k-c) continue;
		umax(mx, a[i]);
		find(c+1, i+1, sum+mx);
	}
}

void solve(){
	cin>>n>>k;
	for(int i=0;i<n;i++) cin>>a[i];
	vii tmp(n, 0);
	find(0ll, 0ll, 0ll);
	cout<<ans<<endl;
	return;
}

main(){
	fastios
	int t = 0;
	if(!t) solve();
	else {
		cin>>t;
		while (t--) solve();
	}
}

컴파일 시 표준 에러 (stderr) 메시지

blocks.cpp:56:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   56 | main(){
      |      ^

• Subtask 1: 0 / 14
• Subtask 2: 18 / 18
• Subtask 3: 0 / 21
• Subtask 4: 0 / 47