Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<fstream>
- #include<algorithm>
- using namespace std;
- const long long int MAXN=10000000;
- struct elemento
- {
- long long int voto;
- long long int indice;
- }A[MAXN];
- bool confronta(elemento &a, elemento &b)
- {
- return a.voto>b.voto;
- }
- long long int solve(int n,int* m,int* p)
- {
- for(long long int i=0;i<n;i++)
- {
- A[i].indice=i;
- A[i].voto=m[i]-p[i];
- }
- nth_element(A,A+n/2, A+n, confronta);
- long long int sommatotale=0;
- for(long long int i=0;i<n/2;i++)
- sommatotale+=m[A[i].indice];
- for(long long int i=n/2;i<n;i++)
- sommatotale+=p[A[i].indice];
- return sommatotale;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement