Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstring>
- #include <vector>
- #include <set>
- #include <map>
- #include <sstream>
- #include <cstdio>
- #include <algorithm>
- #include <stack>
- #include <queue>
- #include <cmath>
- #include <iomanip>
- #include <fstream>
- using namespace std;
- int main() {
- int n,x,res=0;
- bool nmz=false;
- cin>>n>>x;
- vector <int> v(n);
- for (int i=0;i<n;i++){
- cin>>v[i];
- }
- sort( v.begin(),v.end());
- for (int i=0,j=n-1;i<=j;){
- if (v[i]+v[j]<=x){
- res++;
- i++;
- j--;
- }
- else if(v[i]+v[j]>x) {
- j--;
- res++;
- }
- }
- cout <<res;
- }
Advertisement
Add Comment
Please, Sign In to add comment