code jam 2015 Problem C. Less Money, More Problems

每次贪心地选择最小的。。。。

#include <iostream>#include <queue>#include <stack>#include <map>#include <set>#include <bitset>#include <cstdio>#include <algorithm>#include <cstring>#include <climits>#include <cstdlib>#include <cmath>#include <time.h>#define maxn 105#define maxm 80005#define eps 1e-7#define mod 1000000007#define INF 0x3f3f3f3f#define PI (acos(-1.0))#define lowbit(x) (x&(-x))#define mp make_pair#define ls o<<1#define rs o<<1 | 1#define lson o<<1, L, mid #define rson o<<1 | 1, mid+1, R#define pii pair<int, int>#pragma comment(linker, "/STACK:16777216")typedef long long LL;typedef unsigned long long ULL;//typedef int LL;using namespace std;LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}//headLL a[maxn];int n;void work(){LL c, d, v;scanf("%lld%lld%lld", &c, &d, &v);LL now = 0;for(int i = 1; i <= d; i++) scanf("%lld", &a[i]);sort(a+1, a+n+1);int i = 1, cnt = 0;while(now < v) {if(i <= d && now + 1 >= a[i]) now += a[i++] * c;else now += (now+1) * c, cnt++;}printf("%d\n", cnt);}int main(){freopen("input", "r", stdin);freopen("output", "w", stdout);int _;scanf("%d", &_);for(int i = 1; i <= _; i++) {printf("Case #%d: ", i);work();}return 0;}