Submission #3025013

---

Source Code Expand

#include<string>
#include<iostream>
#include<algorithm>
#include<set>
#include<math.h>
#include<vector>
#include<sstream>
#include<queue>
#include<functional>
#include<bitset>
#include<cstdio>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include <string.h>
using ll = long long;

#define rep(i, n) for(ll i = 0; i < (int)(n); i++)
#define reps(i,x) for(ll i=1;i<=(int)(x);i++)
#define rrep(i,x) for(ll i=((int)(x)-1);i>=0;i--)
#define rreps(i,x) for(ll i=(int)(x);i>0;i--)
#define all(x) (x).begin(),(x).end()
#define m0(x) memset(x,0,sizeof(x))
#define vll vector<ll>
#define vi vector<int>
#define mp make_pair
#define vpll vector<pair<ll,ll>>
#define vpi vector<pair<int,int>>
#define mod 1000000007 
using namespace std;
int p[11];
int c[11];
int main() {
	int d,g;
	cin >> d >> g;
	rep(i ,d){
		cin >> p[i] >> c[i];
	}
	int ans = 1 << 30;
	rep(i, (1 << d)){
		int s = 0, t = 0, mx = 0, cm = 100;
		rep(j, d){
			if(i >> j & 1){
				s += p[j];		
				t += (j + 1) * 100 * p[j] + c[j];
			}else{
				mx = j;
			}
		}
		if(g > t){
			int n = g - t;
			if((int)ceil(n*1.0 / ((mx + 1) * 100)) > p[mx]) {
				continue;
			}
			s +=ceil(n*1.0 / ((mx + 1) * 100));
		}
		ans = min(s, ans);
	}
	cout << ans << endl;
}

Submission Info

Judge Result