Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //Nguyen Huu Hoang Minh
- #include <bits/stdc++.h>
- #define sz(x) int(x.size())
- #define all(x) x.begin(),x.end()
- #define reset(x) memset(x, 0,sizeof(x))
- #define pb push_back
- #define mp make_pair
- #define fi first
- #define se second
- #define N 105
- #define remain(x) if (x > MOD) x -= MOD
- #define ii pair<int, int>
- #define iiii pair< ii , ii >
- #define viiii vector< iiii >
- #define vi vector<int>
- #define vii vector< ii >
- #define bit(x, i) (((x) >> (i)) & 1)
- #define Task "test"
- #define int long long
- using namespace std;
- typedef long double ld;
- const int inf = 1e10;
- const int minf = -1e10;
- int n, t, k;
- ii a[N];
- int ans = 0;
- bool cmp(ii a, ii b){
- return a.se > b.se;
- }
- void readfile()
- {
- ios_base::sync_with_stdio(false);
- cin.tie(0);cout.tie(0);
- if (fopen(Task".inp","r"))
- {
- freopen(Task".inp","r",stdin);
- //freopen(Task".out","w",stdout);
- }
- cin >> n >> t >> k;
- for(int i=1; i<=n; i++) cin >> a[i].fi >> a[i].se;
- sort(a+1,a+1+n,cmp);
- }
- void calc(int high, int cc){
- vector<int> dp(high+10,0);
- for(int i=1; i<=high; i++){
- dp[i] = max(dp[i],dp[i-1]);
- for(int j=1; j<=n; j++){
- if (i>=a[j].se/5*4){
- dp[i] = max(dp[i],dp[i-a[j].se/5*4]+a[j].fi);
- }
- }
- }
- ans = max(ans,dp[high]+cc);
- }
- void proc()
- {
- if (a[1].se>=k)
- {
- int i=1;
- while(a[i].se>=k){
- calc(t-a[i].se,a[i].fi);
- i++;
- }
- vector<int> dp(t+1,0);
- for(int s=1; s<=t; s++){
- for(int j=i; j<=n; j++){
- if (s-a[j].se>=0){
- dp[s] = max(dp[s],dp[s-a[j].se]+a[j].fi);
- }
- }
- }
- ans = max(ans,dp[t]);
- }
- else{
- vector<int> dp(t+1,0);
- for(int i=1; i<=t; i++){
- for(int j=1; j<=n; j++){
- if (i-a[j].se>=0){
- dp[i] = max(dp[i],dp[i-a[j].se]+a[j].fi);
- }
- }
- }
- ans = max(ans,dp[t]);
- }
- cout << ans;
- }
- signed main()
- {
- readfile();
- proc();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement