paste bin
Author
Language
C++
Plain text
Accesslog
Action script
Ada
Apache
Arduino
Armasm
Autohotkey
Awk
Bash
Basic
Brainfuck
C
Clojure
Cmake
C#
css
D
Delphi
Dockerfile
Erlang
Fortran
F#
Gauss
Go
Gradle
Graphql
Groovy
Haskell
Ini
Java
JavaScript
json
Julia
Kotlin
Lasso
LaTeX
Leaf
lisp
llvm
Lua
Makefile
Markdown
Mathematica
Matlab
Nginx
Objective-C
Ocaml
Oxygene
Perl
PgSQL
php
Powershell
Processing
Profile
Properties
Puppet
Purebasic
Python
Q
QML
R
Ruby
Rust
Scala
Scheme
Scilab
Shell
Smalltalk
SQL
Swift
Typescript
VB.NET
VB Script
Verilog
Vim
Wasm
x86asm
Xml
Xquery
Yaml
source code:
#include <cstdio> #include <algorithm> using std::max; int main() { int T,M,*Time,*Value,i,j; int dp[10001]; scanf("%d %d",&T,&M); Time=new int [M+2]; Value=new int [M+2]; for(i=0;i<=T;i++) dp[i]=0; for(i=1;i<=M;i++) scanf("%d %d",&Time[i],&Value[i]); for(i=1;i<=M;i++) { for(j=T;j>=1;j--) if(j>=Time[i]) dp[j]=max(dp[j],dp[j-Time[i]]+Value[i]); } printf("%d\n",dp[T]); return 0; }
comment: