fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define ms(s,n) memset(s,n,sizeof(s))
  5. #define all(a) a.begin(),a.end()
  6. #define present(t, x) (t.find(x) != t.end())
  7. #define sz(a) int((a).size())
  8. #define FOR(i, a, b) for (int i = (a); i < (b); ++i)
  9. #define FORd(i, a, b) for (int i = (a) - 1; i >= (b); --i)
  10. #define pb push_back
  11. #define pf push_front
  12. #define fi first
  13. #define se second
  14. #define mp make_pair
  15.  
  16. typedef long long ll;
  17. typedef unsigned long long ull;
  18. typedef long double ld;
  19. typedef pair<int,int> pi;
  20. typedef vector<int> vi;
  21. typedef vector<pi> vii;
  22.  
  23. const int MOD = (int) 1e9+7;
  24. const int INF = (int) 1e9+1;
  25. inline ll gcd(ll a,ll b){ll r;while(b){r=a%b;a=b;b=r;}return a;}
  26. inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
  27.  
  28.  
  29. int main(){
  30. 	#ifndef ONLINE_JUDGE
  31. 	freopen("input.txt", "r", stdin);
  32. 	freopen("output.txt", "w", stdout);
  33. 	#endif
  34. 	int n, k; cin >> n >> k;
  35. 	vector<pair<int,int>> a(n);
  36. 	for(int i = 0; i < n; i++){
  37. 		cin >> a[i].first;
  38. 		a[i].second = i;
  39. 	}
  40. 	sort(all(a));
  41. 	int l = 0, r = n - 1;
  42. 	while(l < r){
  43. 		if(a[l].first + a[r].first == k){
  44. 			cout << a[l].second + 1 << " " << a[r].second + 1 << endl;
  45. 			return 0;
  46. 		}
  47. 		else if(a[l].first + a[r].first < k)
  48. 			++l;
  49. 		else --r;
  50. 	}
  51. 	cout << "IMPOSSIBLE\n";
  52. 	return 0;
  53. }
  54.  
Runtime error #stdin #stdout 0.65s 2095940KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/a7o6YR
language:
C++14 (gcc 8.3)
created:
3 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!