#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <map>
#include <cstring>
#include <iterator>
#include <cmath>
#include <algorithm>
#include <stack>
#include <deque>
#include <map>#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1const int maxn = 1e5+100;
const int maxm = 1e3 + 100;
const int maxa = 1e3 + 100;
const int maxb = 15;
using namespace std;
const int INF = 0x3fffffff;int a[maxn];
int b[maxn];
int k[maxm];
int p[maxm];
int dp[maxa][maxb]; // dp(i, j)生命值为i , 防御值为 j 的时候消灭它花费最少int main() {int n, m;while( scanf( "%d%d", &n, &m ) == 2 ) {int defend = 0;int attack = 0;int ma = 0;for( int i = 1; i <= n; i++ ) {scanf( "%d%d", a+i, b+i );defend = max( defend, *(b+i) );ma = max( ma, *(a+i) );}for( int i = 1; i <= m; i++ ) {scanf( "%d%d", k+i, p+i );attack = max( attack, *(p+i) );}if( attack <= defend ) {printf( "-1\n" );continue;}for( int i = 0; i <= ma; i++ ) {for( int j = 0; j <= defend; j++ ) {if( i == 0 ) dp[0][j] = 0;else dp[i][j] = INF;}}for( int i = 1; i <= ma; i++ ) {for( int j = 0; j <= defend; j++ ) {for( int t = 1; t <= m; t++ ) {if( j > p[t] ) continue;else if( i - (p[t]-j) >= 0 ) {dp[i][j] = min( dp[i][j], dp[i-(p[t]-j)][j]+k[t] );}else dp[i][j] = min( dp[i][j], dp[0][j]+k[t] );}}}long long res = 0;for( int i = 1; i <= n; i++ ) {res += dp[a[i]][b[i]];}printf( "%lld\n", res );}return 0;
}

#include <bits/stdc++.h>
using namespace std;typedef long long LL;
const int maxn = 100100;
const int maxm = 1010;
const int maxp = 10010;
const int maxa = 1010;
const int maxb = 11;
const LL inf = (1LL << 60);
int n, m;
int a[maxn], b[maxn], k[maxm], p[maxm];
LL f[maxa][maxb];signed main() {// freopen("in", "r", stdin);while(~scanf("%d %d",&n,&m)) {for(int i = 0; i < maxa; i++) {for(int j = 0; j < maxb; j++) {f[i][j] = inf;}}for(int i = 0; i < maxb; ++i) f[0][i] = 0;int ha = -1, hb = -1;for(int i = 1; i <= n; i++) {scanf("%d%d",&a[i], &b[i]);ha = max(ha, a[i]);hb = max(hb, b[i]);}for(int i = 1; i <= m; i++) scanf("%d%d",&k[i], &p[i]);for(int i = 1; i <= ha; i++) {for(int j = 0; j <= hb; j++) {for(int x = 1; x <= m; x++) {if(j >= p[x]) continue;if(i + j - p[x] > 0) f[i][j] = min(f[i][j], f[i+j-p[x]][j] + k[x]);else f[i][j] = min(f[i][j], f[0][j] + k[x]);}}}LL ret = 0;bool flag = 0;for(int i = 1; i <= n; i++) {if(f[a[i]][b[i]] == inf) {flag = 1;break;}ret += f[a[i]][b[i]];}if(flag) puts("-1");else printf("%I64d\n", ret);}return 0;
}
Close
BestCoder Contest System 2.0