1334B middle class

-
  1. #include <cstdio>
  2. #include <algorithm>
  3. #define LL long long
  4. using namespace std;
  5. int a[100010];
  6. LL sum;
  7. int cmp(int a,int b){
  8. return a>b;
  9. }
  10. int main(){
  11. int t,n,x,i,j,c=0;
  12. scanf("%d",&t);
  13. while(t--){
  14. c=0;
  15. scanf("%d%d",&n,&x);
  16. sum=0;
  17. for(i=1;i<=n;i++)scanf("%d",&a[i]);
  18. sort(a+1,a+1+n,cmp);
  19. j=0;
  20. for(i=1;i<=n;i++){
  21. if(a[i]>=x){ sum+=a[i]-x; c++;}
  22. else{j=i;break;}}
  23. if(j==0)
  24. {printf("%d\n",n);continue;}
  25. for(i=j;i<=n;i++)
  26. {
  27. if(sum>=x-a[i]){
  28. c++;
  29. sum-=x-a[i];
  30. }
  31. }
  32. printf("%d\n",c);
  33.  
  34. }
  35. return 0;
  36. }133

Comments

Post a Comment

Popular posts from this blog

Codeforce Problem 1703A. YES or YES?

-
A. YES or YES?   There is a string  s �  of length  3 3 , consisting of uppercase and lowercase English letters. Check if it is equal to " YES " (without quotes), where each letter can be in any case. For example, " yES ", " Yes ", " yes " are all allowable. Input The first line of the input contains an integer  t �  ( 1 ≤ t ≤ 10 3 1 ≤ � ≤ 10 3 ) — the number of testcases. The description of each test consists of one line containing one string  s �  consisting of three characters. Each character of  s �  is either an uppercase or lowercase English letter. Output For each test case, output " YES " (without quotes) if  s �  satisfies the condition, and " NO " (without quotes) otherwise. You can output " YES " and " NO " in any case (for example, strings " yES ", " yes " and " Yes " will be recognized as a positive response). Example input Copy 10 YES yES yes Yes YeS Noo orZ yEz Y...
Read more

Aptitude test assistant programmer 2018

-
 #include <stdio.h> #include <stdlib.h> int main() { char str[100]; int i; int space=0;     printf("Enter a string\n");     fgets(str,sizeof(str),stdin);     i=0;     while(i<=str[i]){  if(str[i]==' '){         space++;     }     i++; } printf("Total word count :%d" ,space+1);       return 0; }
Read more

1041A. Heist solution

-
#include <iostream> #include <algorithm> using namespace std ; int main () { long int n ; cin >> n ;   long long arr [ n ]; for ( int j = 0 ; j < n ; j ++){ cin >> arr [ j ];}   sort ( arr , arr + n );   int b = arr [ 0 ];   int l = arr [ n - 1 ];   int x = 0 ;   for ( int i = b ; i <= l ; i ++) {   x ++; }   cout << x - n ;   return 0 ; }
Read more