Submission #1813592


Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	
	int N; cin >> N;
	vector<P> AB(N);
	rep (i, N){
		int A, B; cin >> A >> B;
		AB[i].first = A;
		AB[i].second = B;
	} // end rep

	sort(ALL(AB));

	int res = AB[N-1].first + AB[N-1].second;

	cout << res << endl;

	return 0;
}

Submission Info

Submission Time
Task B - Different Distribution
User ty70
Language C++14 (GCC 5.4.1)
Score 200
Code Size 485 Byte
Status AC
Exec Time 28 ms
Memory 1024 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 23
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt AC 28 ms 1024 KB
02.txt AC 28 ms 1024 KB
03.txt AC 28 ms 1024 KB
04.txt AC 28 ms 1024 KB
05.txt AC 28 ms 1024 KB
06.txt AC 28 ms 1024 KB
07.txt AC 28 ms 1024 KB
08.txt AC 28 ms 1024 KB
09.txt AC 28 ms 1024 KB
10.txt AC 28 ms 1024 KB
11.txt AC 24 ms 1024 KB
12.txt AC 26 ms 1024 KB
13.txt AC 26 ms 1024 KB
14.txt AC 28 ms 1024 KB
15.txt AC 1 ms 256 KB
16.txt AC 1 ms 256 KB
17.txt AC 1 ms 256 KB
18.txt AC 1 ms 256 KB
19.txt AC 1 ms 256 KB
20.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB