1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
|
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cctype>
#define INF 2000000000
using namespace std;
typedef long long ll;
int (){
int f=1,x=0;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-f;c=getchar();}
while(c>='0'&&c<='9')x=x*10+c-'0',c=getchar();
return f*x;
}
pair<int,int> P[205];
int n,A[205],B[205],f[205][40005],sum[205];
int cmp(pair<int,int> a,pair<int,int> b){
return a.second>b.second;
}
void init(){
n=read();
for(int i=1;i<=n;i++)P[i].first=read(),P[i].second=read();
sort(P+1,P+n+1,cmp);
for(int i=1;i<=n;i++)A[i]=P[i].first,B[i]=P[i].second;
for(int i=1;i<=n;i++)sum[i]=sum[i-1]+A[i];
}
void solve(){
memset(f,0x3f,sizeof(f));
f[0][0]=0;
for(int i=1;i<=n;i++){
for(int j=0;j<=sum[i-1];j++){
f[i][j]=min(f[i][j],max(f[i-1][j],sum[i-1]-j+A[i]+B[i]));
f[i][j+A[i]]=min(f[i][j+A[i]],max(f[i-1][j],j+A[i]+B[i]));
}
}
int ans=INF;
for(int i=0;i<=sum[n];i++)ans=min(ans,f[n][i]);
printf("%dn",ans);
}
int main(){
init();
solve();
return 0;
}
|
近期评论