Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- using lli = long long;
- const int N = 2e3;
- lli ar[N+10];
- int main(){
- int n;
- scanf("%d", &n);
- for(int i=1;i<=2*n;i++) scanf("%lld", &ar[i]);
- sort(ar+1, ar+2*n+1);
- lli s = 0;
- for(int i=1;i<=n;i++)
- s += (lli) ar[i] * ar[2*n-i+1];
- printf("%lld", s);
- return 0;
- }
- // Greedy
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement