Task: | Ice cream |
Sender: | FredrikEkholm |
Submission time: | 2017-01-22 14:36:12 +0200 |
Language: | C++ |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 100 |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.04 s | details |
#2 | ACCEPTED | 0.04 s | details |
#3 | ACCEPTED | 0.03 s | details |
#4 | ACCEPTED | 0.04 s | details |
#5 | ACCEPTED | 0.06 s | details |
#6 | ACCEPTED | 0.05 s | details |
#7 | ACCEPTED | 0.05 s | details |
#8 | ACCEPTED | 0.04 s | details |
#9 | ACCEPTED | 0.05 s | details |
#10 | ACCEPTED | 0.04 s | details |
Code
#include <bits/stdc++.h>using namespace std;#define rep(i, a, b) for(int i = a; i < int(b); ++i)#define trav(a, v) for(auto& a : v)#define all(x) x.begin(), x.end()#define sz(x) (int)(x).size()#define D(x) cerr << #x << " = " << x << endltypedef long long ll;typedef pair<int, int> pii;typedef vector<int> vi;int main() {int n, x;cin >> n >> x;int p[101];int w[101];rep(i,0,n){cin >> p[i];cin >> w[i];}int best = 0;rep(i,0,n){rep(j,i,n){if (x >= p[i] + p[j]) {best = max(best, w[i] + w[j]);}}}cout << best;}
Test details
Test 1
Verdict: ACCEPTED
input |
---|
1 749 88 363 |
correct output |
---|
726 |
user output |
---|
726 |
Test 2
Verdict: ACCEPTED
input |
---|
2 902 968 550 152 228 |
correct output |
---|
456 |
user output |
---|
456 |
Test 3
Verdict: ACCEPTED
input |
---|
5 295 35 81 653 771 747 823 871 611 ... |
correct output |
---|
162 |
user output |
---|
162 |
Test 4
Verdict: ACCEPTED
input |
---|
10 272 38 13 114 420 42 344 942 307 ... |
correct output |
---|
840 |
user output |
---|
840 |
Test 5
Verdict: ACCEPTED
input |
---|
50 468 867 254 870 736 28 739 60 609 ... |
correct output |
---|
2000 |
user output |
---|
2000 |
Test 6
Verdict: ACCEPTED
input |
---|
100 739 395 712 476 916 102 614 312 533 ... |
correct output |
---|
1928 |
user output |
---|
1928 |
Test 7
Verdict: ACCEPTED
input |
---|
100 781 342 898 466 888 713 516 133 389 ... |
correct output |
---|
1894 |
user output |
---|
1894 |
Test 8
Verdict: ACCEPTED
input |
---|
100 297 423 506 135 31 279 441 362 969 ... |
correct output |
---|
1906 |
user output |
---|
1906 |
Test 9
Verdict: ACCEPTED
input |
---|
100 875 917 956 243 815 365 575 42 846 ... |
correct output |
---|
1960 |
user output |
---|
1960 |
Test 10
Verdict: ACCEPTED
input |
---|
100 651 963 307 169 423 172 150 779 998 ... |
correct output |
---|
1970 |
user output |
---|
1970 |