Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdio>
- #include <cstdlib>
- #include <algorithm>
- #include <vector>
- using namespace std;
- int main()
- {
- int n,i,meio,inicio,fim;
- cin>>n;
- vector< pair<int,int> >vet;
- int aux;
- for(i=0;i<n;i++){
- cin>>aux;
- vet.push_back(make_pair(aux,i+1));
- }
- meio = n / 2;
- inicio = 0;
- fim = n-1;
- sort(vet.begin(),vet.end());
- while(inicio <= meio && fim >= meio){
- printf("%d %d",vet[inicio].second,vet[fim].second);
- printf("\n");
- inicio++;
- fim--;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement