CSES - Datatähti Open 2017 - Results
Submission details
Task:Ice cream
Sender:Xellos
Submission time:2017-01-19 21:43:31 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
Test results
testverdicttime
#10.04 sdetails
#20.04 sdetails
#30.04 sdetails
#40.04 sdetails
#50.04 sdetails
#60.05 sdetails
#70.04 sdetails
#80.05 sdetails
#90.03 sdetails
#100.03 sdetails

Code

#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge

#ifdef DONLINE_JUDGE
	// palindromic tree is better than splay tree!
	#define lld I64d
#endif

/*
	Spurdo Spärde :DDDD
	SPEDE BEARD
	PEDRO SPORA
	PURJO PORE
	SPEARMINT PUDDING
	SPORO LORO
	PUDRO BARDE
	BENIS XDDDD :DDD XD
*/

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(10);

	int N,B;
	cin >> N >> B;
	vector< pair<int,int> > A(N);
	for(int i =0; i < N; i++) cin >> A[i].ff >> A[i].ss;

	int ans =0;
	for(int i =0; i < N; i++) for(int j =0; j < N; j++) if(A[i].ff+A[j].ff <= B)
		ans =min(ans,A[i].ss+A[j].ss);

	cout << ans << "\n";
	return 0;}

// look at my code
// my code is amazing

Test details

Test 1

Verdict:

input
1 749
88 363

correct output
726

user output
0

Test 2

Verdict:

input
2 902
968 550
152 228

correct output
456

user output
0

Test 3

Verdict:

input
5 295
35 81
653 771
747 823
871 611
...

correct output
162

user output
0

Test 4

Verdict:

input
10 272
38 13
114 420
42 344
942 307
...

correct output
840

user output
0

Test 5

Verdict:

input
50 468
867 254
870 736
28 739
60 609
...

correct output
2000

user output
0

Test 6

Verdict:

input
100 739
395 712
476 916
102 614
312 533
...

correct output
1928

user output
0

Test 7

Verdict:

input
100 781
342 898
466 888
713 516
133 389
...

correct output
1894

user output
0

Test 8

Verdict:

input
100 297
423 506
135 31
279 441
362 969
...

correct output
1906

user output
0

Test 9

Verdict:

input
100 875
917 956
243 815
365 575
42 846
...

correct output
1960

user output
0

Test 10

Verdict:

input
100 651
963 307
169 423
172 150
779 998
...

correct output
1970

user output
0