Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define PB push_back
- #define ZERO (1e-10)
- #define INF (1<<29)
- #define CL(A,I) (memset(A,I,sizeof(A)))
- #define DEB printf("DEB!\n");
- #define D(X) cout<<" "<<#X": "<<X<<endl;
- #define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
- typedef long long ll;
- typedef long double ld;
- typedef pair<ll,ll> pll;
- typedef vector<int> vi;
- typedef pair<int,int> ii;
- typedef vector<ii> vii;
- #define IN(n) int n;scanf("%d",&n);
- #define FOR(i, m, n) for (int i(m); i < n; i++)
- #define REP(i, n) FOR(i, 0, n)
- #define F(n) REP(i, n)
- #define FF(n) REP(j, n)
- #define FT(m, n) FOR(k, m, n)
- #define aa first
- #define bb second
- void ga(int N,int *A){F(N)scanf("%d",A+i);}
- unordered_set<int> S;
- #define MX (10000)
- int N,A[MX],M,d,h;
- int main(void){
- while(~scanf("%d",&N)){
- ga(N,A),S.clear(),d=INF;
- scanf("%d",&M);
- F(N){
- if(abs(M-2*A[i])<d&&S.count(M-A[i]))d=abs(M-2*A[i]),h=min(A[i],M-A[i]);
- S.insert(A[i]);
- }
- printf("Peter should buy books whose prices are %d and %d.\n\n",h,M-h);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement