# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
207487 | mohamedsobhi777 | Schools (IZhO13_school) | C++14 | 143 ms | 262148 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std ;
const int N = 3e5 + 7 ;
int n , m , k ;
int a[N] , b[N] ;
long long dp[500][500][500];
long long solve(int i , int M , int K)
{
if(i==n)
{
return (!M && !K?0 : -1e14);
}
if(dp[i][M][K]!=-1)
return dp[i][M][K];
long long ret = solve(i+1 , M , K) ;
ret = max(ret , a[i] + solve(i+1 , M-1 , K) ) ;
ret = max(ret , solve(i+1 , M , K-1) + b[i] ) ;
return dp[i][M][K] = ret ;
}
int main()
{
memset(dp , -1 , sizeof dp) ;
freopen("school.in" , "r" , stdin) ;
freopen("school.out" , "w" , stdout) ;
cin>>n>>m>>k ;
for(int i= 0 ; i < n ; i++)
cin>>a[i]>>b[i];
cout<<solve(0, m , k) ;
return 0 ;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |