#include<stdio.h>
#include <algorithm>
using namespace std;
#define MAX_NUMBER 100000
long long SolveTime[MAX_NUMBER];
int main(void){
long long P;
long long N;
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]);
}
sort(SolveTime,SolveTime+N);
long long SUM=0;
for(int i=0; i<N; i++){
SUM+=SolveTime[i];
Possible=i+1;
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);
scanf("%*d");
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
1868 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |