Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- const int SIZE = 200001;
- int p[SIZE];
- int main(){
- int N;
- scanf("%d",&N);
- for(int i=1;i<=N;i++)scanf("%d",&p[i]);
- sort(p+1,p+N+1);
- long long left_part=p[1],right_part=0;
- for(int i=2;i<=N;i++){
- left_part+=p[i];
- right_part+=p[N+2-i];
- if(left_part<=right_part)
- return 0*printf("bad\n%d\n",i-1);
- }
- return 0*puts("good");
- }
Advertisement
Add Comment
Please, Sign In to add comment