Untitled
unknown
plain_text
4 years ago
968 B
23
Indexable
import java.util.Scanner;
public class Main
{
public static void qs(int a[], int low, int high)
{
int p = a[(low+high)/2];
int l = low;
int r = high;
int i;
while( l < r)
{
while(a[l] < p) l++;
while(a[r] > p) r--;
if(l > r) break;
int k = a[l];
a[l] = a[r];
a[r] = k;
l++;
r--;
}
if(l < high) qs(a,l,high);
if(low < r) qs(a,low,r);
}
public static void main(String[] args)
{
Scanner n = new Scanner(System.in);
int a[] = new int[1000000];
int N = n.nextInt();
int C = n.nextInt();
int i;
int sum = 0;
for(i = 0;i<N;i++)
{
a[i] = n.nextInt();
sum+=a[i];
}
if(sum <= C)
{
System.out.print(sum);
}
else
{
qs(a,0,N-1);
i = 0;
while(sum > C)
{
sum-=a[i];
i++;
}
System.out.print(sum);
}
}
}
Editor is loading...