1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; long long n,a[5005],l,r,s1,s2; int main(){ cin>>n; for(int i=1;i<=2*n;i++) cin>>a[i]; l=1; r=2*n; for(int i=1;i<=n;i++) { if(a[l]>a[r])s1=s1+a[l]+a[r],l++,r--; else s2=s2+a[r]+a[l],l++,r--; } if(s1>s2)cout<<1<<" "<<s1-s2; else cout<<2<<" "<<s2-s1; return 0; }Python :
# coding=utf-8 n = int(input()) cards = list(map(int, input().split())) sum_a = sum(cards[:n]) sum_b = sum(cards[n:]) for i in range(n): a = cards[i] b = cards[2 * n - 1 - i] if a > b: sum_a += b sum_b -= b else: sum_b += a sum_a -= a if sum_a > sum_b: print(1, sum_a - sum_b) else: print(2, sum_b - sum_a)
- 1
Information
- ID
- 1074
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- 3
- Tags
- # Submissions
- 32
- Accepted
- 20
- Uploaded By