# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
5363 | baneling100 | King of penalty (kriii1_K) | C++98 | 24 ms | 1476 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <algorithm>
using namespace std;
int p, n, t[100001], cnt;
long long ans;
void input(void)
{
int i;
scanf("%d %d",&p,&n);
for(i=1 ; i<=n ; i++)
scanf("%d",&t[i]);
sort(t+1,t+n+1);
}
void process(void)
{
int i;
p--;
for(i=1 ; i<=n ; i++)
{
if(p>=t[i])
{
cnt++;
ans+=p;
p-=t[i];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |