oj.uz

답안 #95419

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
95419 2019-02-01T04:00:53 Z easrui 만두 (JOI14_ho_t2) C++14
0 / 100
 140 ms 1284 KB 
#include <bits/stdc++.h>
using namespace std;
const int MM = 1e4+5;
const int MN = 505;
int M,N,P[MM],S[MM],C[MN],E[MN],ans,res;
int D[10*MM][2];

int main()
{
    //freopen("input.txt","r",stdin);
    ios_base::sync_with_stdio(0),cin.tie(0);
    cin >> M >> N;
    for(int i=1; i<=M; i++)
        cin >> P[i];
    sort(P+1,P+M+1,greater<int>());
    for(int i=1; i<=M; i++){
        S[i] = S[i-1] + P[i];
    }
    for(int i=1; i<=1e5; i++) D[i][0] = D[i][1] = 1e9;
    for(int i=1; i<=N; i++) cin >> C[i] >> E[i];
    for(int i=1; i<=N; i++){
        for(int j=1e5; j>=C[i]; j--){
            D[j][i%2] = min(D[j][(i+1)%2],D[j-C[i]][(i+1)%2] + E[i]);
            if(j!=1e5) D[j][i%2] = min(D[j][i%2],D[j+1][i%2]);
        }
    }
    //cout << D[2][N%2];
    for(int i=0; i<=M; i++){
        ans = max(ans,S[i]-D[i][N%2]);
    }
    cout << ans;
}

Subtask #1
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Incorrect 3 ms 1144 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 137 ms 1248 KB Output is correct
2 Correct 136 ms 1244 KB Output is correct
3 Correct 140 ms 1144 KB Output is correct
4 Correct 138 ms 1144 KB Output is correct
5 Correct 137 ms 1284 KB Output is correct
6 Incorrect 135 ms 1144 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Incorrect 3 ms 1144 KB Output isn't correct
3 Halted 0 ms 0 KB -