Submission #3613

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
3613	2013-08-31T06:58:57 Z	MiNu	King of penalty (kriii1_K)	C++	0 / 1	20 ms	1936 KB

K

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;

int main()
{
    int n, p;
    scanf("%d %d", &p, &n);

    int t[n+1];
    int s = 0;
    for ( int i=0 ; i<n ; ++i )
    {
        scanf("%d", &t[i]);
    }
    sort(t, t+n);

    int k = 0;
    for ( int i=0 ; i<n ; ++i )
    {
        if ( s + t[i] < p )
        {
            s += t[i];
            ++k;
        }
        else 
        {
            k = i-1;
            break;
        }
    }

    int e = p - s - 1;
    long long total = 0LL;
    for ( int i=k ; i>=0 ; --i )
    {
        e += t[i];
        total += e;
    }

    printf("%d %lld\n", k+1, total);
    return 0;
}

Subtask #1

0.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	4 ms	1720 KB	Output is correct
8	Correct	8 ms	1740 KB	Output is correct
9	Correct	20 ms	1932 KB	Output is correct
10	Correct	20 ms	1916 KB	Output is correct
11	Incorrect	16 ms	1936 KB	Output isn't correct
12	Halted	0 ms	0 KB	-