Submission #3492

#TimeUsernameProblemLanguageResultExecution timeMemory
3492The_KMJ_GodKing of penalty (kriii1_K)C++98
1 / 1
24 ms2452 KiB
//Problem K #include<cstdio> #include<iostream> #include<algorithm> using namespace std; long long a[100000]; long long start,E; int main() { long long i,j,k,n,tmp; scanf("%lld",&tmp); scanf("%lld",&n); tmp--; for ( i=0; i<n; i++ ) scanf("%lld",&a[i]); sort(a,a+n); long long res=0,cnt=0; for ( i=0; i<n; i++ ) { if ( tmp<=a[i] ) break; res+=tmp; cnt++; tmp-=a[i]; } printf("%lld %lld\n",cnt,res); return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...