oj.uz

Submission #3671

# Submission time Handle Problem Language Result Execution time Memory
3671 2013-08-31T07:32:09 Z BothEarRim King of penalty (kriii1_K) C++
1 / 1
 24 ms 2448 KB 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <utility>
#include <locale>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <climits>
#include <cfloat>
#define PI acos(0.0) * 2.0
using namespace std;

vector<long long> needTime; // 각 문제를 해결하는 데 필요한 시간
long long contestTotTime, prob_N; // 대회 전체 시간, 문제 개수
long long solved_N, penalty_tot; // 푼 문제 개수, 페널티 총합

int main()
{
    scanf("%lld %lld",&contestTotTime, &prob_N);

    contestTotTime--; // 대회 종료순간에는 문제를 제출 못하므로 아예 가진 시간을 1분 줄여 생각한다

    needTime.resize(prob_N);

    for(long long i=0; i<prob_N; i++) scanf("%lld", &needTime[i]);

    sort(needTime.begin(), needTime.end()); // 정렬해서 걸리는 시간이 작은 문제부터 greedy하게 살펴볼 것임

    for(long long i=0, pnt=contestTotTime; i<prob_N && pnt-needTime[i]>=0;)
    {
        solved_N++;
        penalty_tot += pnt; // 대회 시작부터 현재 pnt까지의 시간
        pnt -= needTime[i++];
    }

    printf("%lld %lld\n", solved_N, penalty_tot);
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1676 KB Output is correct
2 Correct 0 ms 1676 KB Output is correct
3 Correct 0 ms 1676 KB Output is correct
4 Correct 4 ms 1828 KB Output is correct
5 Correct 0 ms 1676 KB Output is correct
6 Correct 4 ms 1828 KB Output is correct
7 Correct 8 ms 2020 KB Output is correct
8 Correct 4 ms 2056 KB Output is correct
9 Correct 20 ms 2448 KB Output is correct
10 Correct 24 ms 2412 KB Output is correct
11 Correct 16 ms 2448 KB Output is correct
12 Correct 8 ms 2412 KB Output is correct
13 Correct 0 ms 1676 KB Output is correct
14 Correct 0 ms 1676 KB Output is correct
15 Correct 12 ms 2432 KB Output is correct