Submission #18624

#	Time	Username	Problem	Language	Result	Execution time	Memory
18624		gs14004	King of penalty (kriii1_K)	C++14	1 / 1	29 ms	2112 KiB

K

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <limits.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include <string>
#include <functional>
#include <vector>
#include <numeric>
#include <deque>
#include <utility>
#include <bitset>
#include <iostream>
using namespace std;
typedef long long lint;
typedef long double llf;
typedef pair<int, int> pi;
 
int n, a[100005], p;
 
int main(){
    scanf("%d %d",&p,&n);
    for(int i=0; i<n; i++){
        scanf("%d",&a[i]);
    }
    sort(a, a+n);
    int q = 0, s = n;
    for(int i=0; i<n; i++){
        q += a[i];
        if(q >= p){
            s = i;
            break;
        }
    }
    lint ret = 0, sum = 0;
    for(int i=0; i<s; i++){
        ret += p - 1 - sum;
        sum += a[i];
    }
    printf("%d %lld\n",s,ret);
}

• Subtask 1: 1 / 1