oj.uz

Submission #3477

# Submission time Handle Problem Language Result Execution time Memory
3477 2013-08-31T06:05:19 Z blmarket King of penalty (kriii1_K) C++
1 / 1
 24 ms 2060 KB 
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <numeric>
#include <iterator>
#include <queue>
#include <set>
#include <map>
#include <vector>

#define mp make_pair
#define pb push_back
#define sqr(x) ((x)*(x))
#define foreach(it,c) for(typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)

using namespace std;

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int,int> PII;

template<typename T> int size(const T &a) { return a.size(); } 

int P,C;
vector<int> V;

long long solve(int i) {
    long long ret = 0;
    int pen = P - 1;
    for(int j=0;j<i;j++) {
        ret += pen;
        pen -= V[j];
    }
    return ret;
}

int main(void)
{
    scanf("%d %d",&P, &C);
    V.resize(C);
    for(int i=0;i<C;i++) {
        scanf("%d", &V[i]);
    }
    sort(V.begin(), V.end());

    long long ret = 0;
    int sum = 0;
    for(int i=0;i<size(V);i++) {
        sum += V[i];
        if(sum >= P) {
            cout << i << " " << solve(i) << endl;
            return 0;
        }
    }
    cout << C << " " << solve(C) << endl;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1672 KB Output is correct
2 Correct 0 ms 1672 KB Output is correct
3 Correct 0 ms 1672 KB Output is correct
4 Correct 4 ms 1672 KB Output is correct
5 Correct 0 ms 1672 KB Output is correct
6 Correct 4 ms 1672 KB Output is correct
7 Correct 8 ms 1844 KB Output is correct
8 Correct 12 ms 1864 KB Output is correct
9 Correct 24 ms 2060 KB Output is correct
10 Correct 20 ms 2040 KB Output is correct
11 Correct 16 ms 2060 KB Output is correct
12 Correct 12 ms 2040 KB Output is correct
13 Correct 0 ms 1672 KB Output is correct
14 Correct 0 ms 1672 KB Output is correct
15 Correct 12 ms 2052 KB Output is correct