#include<stdio.h>
#define MAX_NUMBER 100000
int main(void){
long long P;
long long N;
long long SolveTime[MAX_NUMBER];
long long Possible;
long long PAT=0;
long long START_TIME;
scanf("%lld %lld", &P, &N);
for(int i=0; i<N; i++){
scanf("%lld", &SolveTime[i]);
}
//내림차순 정렬
for(int i=0; i<N; i++){
for(int j=i; j<N; j++){
if(SolveTime[i]>SolveTime[j]){
long long temp=SolveTime[i];
SolveTime[i]=SolveTime[j];
SolveTime[j]=temp;
}
}
}
long long SUM=0;
for(int i=0; i<N; i++){
SUM+=SolveTime[i];
Possible=i;
if(SUM>=P){
i--;
break;
}
}
printf("%lld\n", Possible);
START_TIME=P;
for(int i=0; i<Possible; i++){
START_TIME-=SolveTime[i];
}
START_TIME--;
PAT+=START_TIME*Possible;
for(int i=0; i<Possible; i++){
PAT+=SolveTime[i]*(i+1);
}
printf("%lld\n", PAT);
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1748 KB |
Output is correct |
2 |
Correct |
0 ms |
1744 KB |
Output is correct |
3 |
Correct |
32 ms |
1748 KB |
Output is correct |
4 |
Execution timed out |
200 ms |
1748 KB |
Program timed out |
5 |
Halted |
0 ms |
0 KB |
- |