Codechef Starters 114 Division 3 (Rated) Christmas Candy Solution

 

Problem Link :  https://www.codechef.com/problems/CHRISCANDY

Solution in C++:

1. /// Author : AH_Tonmoy
2. #include <bits/stdc++.h>
3. using namespace std;
4. int32_t main() {
5. ios_base::sync_with_stdio(0);
6. cin.tie(0);
7. int t;
8. cin >> t;
9. while (t--) {
10. int n ;
11. cin >> n ;
12. std::vector<int> a(n);
13. for ( int i = 0 ; i < n ; i++){
14. cin >> a[i] ;
15. }
16. int ans = 0 , mx = a[0] ;
17. for ( int i = 1 ; i < n ; i++){
18. if (a[i] > mx ){
19. mx = a[i] ;
20. }
21. else ans++ ;
22. }
23. cout << ans <<'\n';
24. }
25. return 0 ;
26. }