/*ID: xo1LANG: C++TASK: explore*/#include <cstdio>#include <cstdlib>#define ABS(x) (x > 0 ? x : -x)int compare (const void * a, const void * b) { return ( ABS(*(int*)a) - ABS(*(int*)b) );}int main () { FILE *fin = fopen ("explore.in", "r"); FILE *fout = fopen ("explore.out", "w"); int T, N, time = 0; fscanf (fin, "%d %d", &T, &N); int pts[N]; for ( int i = 0; i < N ; i++ ) fscanf (fin, "%d", &(pts[i])); qsort (pts, N, sizeof(int), compare); /*for ( int i = 0; i < N ; i++ ) printf("%d\n", pts[i]);*/ int cnt = 0; for ( int i = 0; i < N ; i++ ) { time += ABS(pts[i]); if (time > T) break; cnt++; } fprintf(fout, "%d\n", cnt); return (0);}