Tuesday, January 21, 2020

Codeforces 158B Taxi Solution in C++


  1. #include <iostream >
  2. using namespace std;
  3. int main()
  4. {
  5. int n,m,g1=0,g2=0,g3=0,s=0;
  6. cin>>n;
  7. for (int i=0;i<n;i++)
  8. {
  9. cin>>m;
  10. if (m==4) s++;
  11. else if (m==3) g3++;
  12. else if (m==2) g2++;
  13. else g1++;
  14. }
  15. g1-=g3;
  16. s+=g3;
  17. if (g2%2==0 && g2>0)
  18. {
  19. s+=g2/2;
  20. g2=0;
  21. }
  22. else if (g2%2==1 && g2>0)
  23. {
  24. s+=g2/2+1;
  25. g1-=2;
  26. }
  27. if (g1>0)
  28. {
  29. s+=g1/4;
  30. if (g1%4>0) s++;
  31. }
  32. cout<<s<<endl;
  33. return 0;
  34. }

No comments:

Post a Comment

Codeforces 131A cAPS lOCK Solution in C

#include <stdio.h> int main () { char ch [ 106 ]; int i , j , ck = 1 ; scanf ( "%s" , ch ); ...