└── hackerrank.txt


/hackerrank.txt:
--------------------------------------------------------------------------------
 1 | import java.util.Arrays;
 2 | import java.util.Scanner;
 3 | 
 4 | import java.io.*;
 5 | /**
 6 |  * @author Kanahaiya Gupta
 7 |  *
 8 |  */
 9 | public class MarkAndToys {
10 | 	public static void main(String[] args) {
11 | public class MarkAndToys 
12 | {
13 | 	public static void main(String[] args)throws IOException
14 | 	{
15 | 		Scanner in = new Scanner(System.in);
16 | 		int n = in.nextInt();
17 | 		int K = in.nextInt();
18 | 		int a[] = new int[n];
19 | 		for (int i = 0; i < n; i++) {
20 | 			a[i] = in.nextInt();
21 | 		int k = in.nextInt();
22 | 		int prices[] = new int[n];
23 | 		int i,j;
24 | 		for (i = 0; i < n; i++)
25 | 		{	
26 | 			prices[i] = in.nextInt();
27 | 		}
28 | 		Arrays.sort(a);
29 | 		int toyCount = 0, sum = 0;
30 | 		for (int i = 0; i < a.length; i++) {
31 | 			sum += a[i];
32 | 			if (sum <= K) {
33 | 		j=maximumToys(prices,k);
34 | 		System.out.println(j);
35 | 	}
36 | 	public static int maximumToys(int[] prices,int k)
37 | 	{
38 | 		int n=prices.length;
39 | 		Arrays.sort(prices);
40 | 		//main programming
41 |     		int toyCount,i,sum;
42 | 		sum=toyCount= 0;
43 | 		for (i = 0; i < n; i++) 
44 | 		{
45 | 			sum += prices[i];
46 | 			if (sum <= k) 
47 | 			{
48 | 				toyCount++;
49 | 			} else {
50 | 			} 
51 | 			else 
52 | 			{
53 | 				break;
54 | 			}
55 | 		}
56 | 		System.out.println(toyCount);
57 | 		in.close();
58 | 		return toyCount;
59 | 	}
60 | }


--------------------------------------------------------------------------------