Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<cstdio>
- #include<algorithm>
- using namespace std;
- int main()
- {
- int maxo,n,wyn=0;
- scanf("%d%d", &maxo, &n);
- int tab[n+1];
- for(int i = 0; i<n;i++)
- scanf("%d", &tab[i]);
- sort(tab,tab+n);
- int a = 0,x = n-1;
- while(a <= x)
- {
- if(tab[a]+tab[x]<=maxo)
- a++;
- x--;
- wyn++;
- }
- printf("%d\n", wyn);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement