fork download

copy

#include <bits/stdc++.h>
using namespace std;
int N,Q;
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	cin>>N>>Q;
	int A[N];
	for(int n=0; n<N; n+=1){
		cin>>A[n];
	}
	int a[Q],b[Q];
	for(int n=0; n<Q; n+=1){
		cin>>a[n]>>b[n];
	}
	sort(A,A+N);
	sort(b,b+Q,[](int lhs,int rhs){
		return ( a[lhs]!=a[rhs] )?a[lhs]<a[rhs]: lhs<rhs;
	});
	sort(a,a+Q,(int lhs,int rhs){
		return ( a[lhs]!=a[rhs] )?a[lhs]<a[rhs]: lhs<rhs;
	});
	for(int n=0; n<Q; n+=1){
		cout<<a[n]<<" "<<b[n]<<"\n";
	}
	return 0;
}

prog.cpp: In lambda function:
prog.cpp:17:12: error: ‘a’ is not captured
   return ( a[lhs]!=a[rhs] )?a[lhs]<a[rhs]: lhs<rhs;
            ^
prog.cpp:16:14: note: the lambda has no capture-default
  sort(b,b+Q,[](int lhs,int rhs){
              ^
prog.cpp:11:6: note: ‘int a [Q]’ declared here
  int a[Q],b[Q];
      ^
prog.cpp:17:20: error: ‘a’ is not captured
   return ( a[lhs]!=a[rhs] )?a[lhs]<a[rhs]: lhs<rhs;
                    ^
prog.cpp:16:14: note: the lambda has no capture-default
  sort(b,b+Q,[](int lhs,int rhs){
              ^
prog.cpp:11:6: note: ‘int a [Q]’ declared here
  int a[Q],b[Q];
      ^
prog.cpp:17:29: error: ‘a’ is not captured
   return ( a[lhs]!=a[rhs] )?a[lhs]<a[rhs]: lhs<rhs;
                             ^
prog.cpp:16:14: note: the lambda has no capture-default
  sort(b,b+Q,[](int lhs,int rhs){
              ^
prog.cpp:11:6: note: ‘int a [Q]’ declared here
  int a[Q],b[Q];
      ^
prog.cpp:17:36: error: ‘a’ is not captured
   return ( a[lhs]!=a[rhs] )?a[lhs]<a[rhs]: lhs<rhs;
                                    ^
prog.cpp:16:14: note: the lambda has no capture-default
  sort(b,b+Q,[](int lhs,int rhs){
              ^
prog.cpp:11:6: note: ‘int a [Q]’ declared here
  int a[Q],b[Q];
      ^
prog.cpp: In function ‘int main()’:
prog.cpp:19:14: error: expected primary-expression before ‘int’
  sort(a,a+Q,(int lhs,int rhs){
              ^~~
prog.cpp:19:14: error: expected ‘)’ before ‘int’
  sort(a,a+Q,(int lhs,int rhs){
             ~^~~
              )
In file included from /usr/include/c++/8/bits/stl_algobase.h:71,
                 from /usr/include/c++/8/bits/char_traits.h:39,
                 from /usr/include/c++/8/ios:40,
                 from /usr/include/c++/8/istream:38,
                 from /usr/include/c++/8/sstream:38,
                 from /usr/include/c++/8/complex:45,
                 from /usr/include/c++/8/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/8/bits/stdc++.h:52,
                 from prog.cpp:1:
/usr/include/c++/8/bits/predefined_ops.h: In instantiation of ‘constexpr bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = int*; _Iterator2 = int*; _Compare = main()::<lambda(int, int)>]’:
/usr/include/c++/8/bits/stl_algo.h:1847:14:   required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/8/bits/stl_algo.h:1885:25:   required from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/8/bits/stl_algo.h:1971:31:   required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/8/bits/stl_algo.h:4866:18:   required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int*; _Compare = main()::<lambda(int, int)>]’
prog.cpp:18:3:   required from here
/usr/include/c++/8/bits/predefined_ops.h:143:18: error: void value not ignored as it ought to be
         { return bool(_M_comp(*__it1, *__it2)); }
                  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/8/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = int*; _Value = int; _Compare = main()::<lambda(int, int)>]’:
/usr/include/c++/8/bits/stl_heap.h:133:48:   required from ‘void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = int*; _Distance = long int; _Tp = int; _Compare = __gnu_cxx::__ops::_Iter_comp_val<main()::<lambda(int, int)> >]’
/usr/include/c++/8/bits/stl_heap.h:237:23:   required from ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = int*; _Distance = long int; _Tp = int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/8/bits/stl_heap.h:342:22:   required from ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/8/bits/stl_algo.h:1672:23:   required from ‘void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/8/bits/stl_algo.h:1933:25:   required from ‘void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/8/bits/stl_algo.h:1948:27:   required from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = int*; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/8/bits/stl_algo.h:1968:25:   required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int, int)> >]’
/usr/include/c++/8/bits/stl_algo.h:4866:18:   required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = int*; _Compare = main()::<lambda(int, int)>]’
prog.cpp:18:3:   required from here
/usr/include/c++/8/bits/predefined_ops.h:177:11: error: void value not ignored as it ought to be
  { return bool(_M_comp(*__it, __val)); }
           ^~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/8/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/8/bits/stdc++.h:65,
                 from prog.cpp:1:
/usr/include/c++/8/bits/stl_algo.h: At global scope:
/usr/include/c++/8/bits/stl_algo.h:1821:5: warning: ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = int*; _Compare = __gnu_cxx::__ops::_Val_comp_iter<main()::<lambda(int, int)> >]’ used but never defined
     __unguarded_linear_insert(_RandomAccessIterator __last,
     ^~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/8/bits/stl_algobase.h:71,
                 from /usr/include/c++/8/bits/char_traits.h:39,
                 from /usr/include/c++/8/ios:40,
                 from /usr/include/c++/8/istream:38,
                 from /usr/include/c++/8/sstream:38,
                 from /usr/include/c++/8/complex:45,
                 from /usr/include/c++/8/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/8/bits/stdc++.h:52,
                 from prog.cpp:1:
/usr/include/c++/8/bits/predefined_ops.h:225:5: warning: ‘__gnu_cxx::__ops::_Val_comp_iter<_Compare> __gnu_cxx::__ops::__val_comp_iter(__gnu_cxx::__ops::_Iter_comp_iter<_Compare>) [with _Compare = main()::<lambda(int, int)>]’ used but never defined
     __val_comp_iter(_Iter_comp_iter<_Compare> __comp)
     ^~~~~~~~~~~~~~~

Standard output is empty