From d96440b7fe42365c0ad7f6118b8e5f64cb32800c Mon Sep 17 00:00:00 2001
From: shubhankarbhagwatbj
 <32715851+shubhankarbhagwatbj@users.noreply.github.com>
Date: Wed, 18 Oct 2017 10:33:16 +0000
Subject: [PATCH 1/3] Add files via upload

---
 c.c | 5 +++++
 1 file changed, 5 insertions(+)
 create mode 100644 c.c

diff --git a/c.c b/c.c
new file mode 100644
index 0000000..3ef85f5
--- /dev/null
+++ b/c.c
@@ -0,0 +1,5 @@
+#include<stdio.h>
+int main()
+{
+	printf("hello world");
+}

From 59f6746087ab92cb751292b577f972df2134e13c Mon Sep 17 00:00:00 2001
From: shubhankarbhagwatbj
 <32715851+shubhankarbhagwatbj@users.noreply.github.com>
Date: Sun, 29 Oct 2017 23:32:59 +0530
Subject: [PATCH 2/3] added 2.c

---
 2.c | 43 +++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 43 insertions(+)
 create mode 100644 2.c

diff --git a/2.c b/2.c
new file mode 100644
index 0000000..d750a3b
--- /dev/null
+++ b/2.c
@@ -0,0 +1,43 @@
+#include<stdio.h>
+int b[25];
+int main()
+{
+	unsigned long long int i,j,k,n,sum;
+	int flag=0;
+	scanf("%llu%llu",&n,&k);
+unsigned long long int a[n];
+	
+
+	for(i=0;i<n;i++)
+	{
+		scanf("%llu",&a[i]);
+		
+	}
+
+	for(i=1;i<(1<<n);i++)
+	{
+		sum=0;
+		for(j=0;j<n;j++)
+		{
+			if(i&(1<<j)==(1<<j))
+			{
+				sum=sum+a[j];
+			}
+		
+			if(sum==k)
+			{
+				flag=1;
+				break;
+			}
+
+		}
+		
+		if(flag==1)
+				break;
+	}
+if(flag==1)
+{printf("yes");}
+else
+{printf("no");}
+return 0;
+}

From cc50ad5ffbbfbd856308944a51bb731265e468ae Mon Sep 17 00:00:00 2001
From: shubhankarbhagwatbj
 <32715851+shubhankarbhagwatbj@users.noreply.github.com>
Date: Sun, 29 Oct 2017 23:34:01 +0530
Subject: [PATCH 3/3] added 5.c

---
 5.c | 51 +++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 51 insertions(+)
 create mode 100644 5.c

diff --git a/5.c b/5.c
new file mode 100644
index 0000000..7b2903d
--- /dev/null
+++ b/5.c
@@ -0,0 +1,51 @@
+#include<stdio.h>
+int main()
+{
+
+	long long int n,v,sum,count,j,i,least,x;
+	int t,p;
+	scanf("%d",&t);
+
+	for(p=1;p<=t;p++)
+	{
+		scanf("%lld%lld",&n,&v);
+                long long int a[n];
+		
+		for(i=0;i<n;i++)
+		{scanf("%lld",&a[i]);}
+
+		for(i=0;i<n-1;i++)
+		{least=i;
+			for(j=i+1;j<n;j++)
+			{
+				if(a[j] < a[least])
+				{least=j;}
+			}
+			x=a[i];
+			a[i]=a[least];
+			a[least]=x;
+		}
+
+		sum=0;
+                count=0;
+               int flag=0;
+		for(i=n-1;i>=0;i--)
+		{
+			sum=sum + a[i];
+			count++;
+			if(sum >= v)
+			{  flag=1;
+                           break;}
+                          
+                       
+		}
+               
+                 if(flag==0)
+                 {printf("-1\n");}
+              
+                  else if (flag==1)
+	          {printf("%lld\n",count);}
+
+	}
+
+}