Cod sursa(job #2113904)

Utilizator Mihai145Oprea Mihai Adrian Mihai145 Data 25 ianuarie 2018 11:23:05
Problema Peste Scor 60
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.96 kb
#include <bits/stdc++.h>
using namespace std;
ifstream fin("peste.in");
ofstream fout("peste.out");
struct obiect
{
    int val, gr;
} o[50002];
struct plasa
{
    int p, t;
} v[50002];
int n, k, nrob, ttotal;
long long best[50002];
bool d[1002];
inline bool cmp(const plasa a, const plasa b)
{
    return a.p>b.p;
}
int main()
{
    int i, j, kk, sp;
    fin>>n>>k>>ttotal;
    for(i=1; i<=n; i++)
    {
        fin>>v[i].p>>v[i].t;
        d[v[i].t]=1;
    }
    sort(v+1,v+n+1,cmp);
    for(i=1; i<=1000; i++)
        if(d[i])
        {
            kk=sp=0;
            for(j=1; j<=n && kk<k; j++)
                if(v[j].t<=i)
                    sp+=v[j].p, kk++;
            o[++nrob].gr=i;
            o[nrob].val=sp;
        }
    for(i=1; i<=ttotal; i++)
        for(j=1; j<=nrob && o[j].gr<=i; j++)
            best[i]=max(max(best[i],best[i-o[j].gr]+(long long)o[j].val),best[i-1]);
    fout<<best[ttotal]<<'\n';
    return 0;
}