Submission #3829

#TimeUsernameProblemLanguageResultExecution timeMemory
3829kaires_King of penalty (kriii1_K)C++98
0 / 1
0 ms1088 KiB
#include<stdio.h> #include<algorithm> using namespace std; int main(){ int p=0; int n=0; int *farr; //int arr[100000]={0,}; int sum=0; int tmp=0; int i=0; scanf("%d",&p); scanf("%d",&n); farr=(int*)malloc(n*sizeof(int)); if(farr==NULL) { exit(0); } for(i=0;i<n;i++){ scanf("%d",&farr[i]); } sort(farr,farr+n); for(int i=0; i<n;i++){ if(i!=n-1){ tmp=tmp+farr[i]; if(tmp>p) break; } } tmp = p-tmp-1; for(i=n-2;i>=0;i--){ sum = sum+(tmp+farr[i]); tmp = tmp+farr[i]; } printf("%d ",n-1); printf("%d",sum); free(farr); }
#Verdict Execution timeMemoryGrader output
Fetching results...