Submission #1813500
Source Code Expand
#include <iostream> #include <sstream> #include <cstdio> #include <cstdlib> #include <cmath> #include <ctime> #include <cstring> #include <string> #include <vector> #include <stack> #include <queue> #include <deque> #include <map> #include <set> #include <bitset> #include <numeric> #include <utility> #include <iomanip> #include <algorithm> #include <functional> using namespace std; #define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl #define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i) template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P) { return s << '<' << P.first << ", " << P.second << '>'; } template<class T> ostream& operator << (ostream &s, vector<T> P) { for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; } template<class T> ostream& operator << (ostream &s, vector<vector<T> > P) { for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; } template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P) { EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; } int N; int a, b; int main() { while (cin >> N) { int Max = 0; int MaxVal = 0; for (int i = 0; i < N; ++i) { cin >> a >> b; if (chmax(Max, a)) MaxVal = b; } cout << Max + MaxVal << endl; } }
Submission Info
Submission Time | |
---|---|
Task | B - Different Distribution |
User | drken |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1612 Byte |
Status | AC |
Exec Time | 108 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
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 | 104 ms | 256 KB |
02.txt | AC | 106 ms | 256 KB |
03.txt | AC | 104 ms | 256 KB |
04.txt | AC | 106 ms | 256 KB |
05.txt | AC | 104 ms | 256 KB |
06.txt | AC | 106 ms | 256 KB |
07.txt | AC | 106 ms | 256 KB |
08.txt | AC | 108 ms | 256 KB |
09.txt | AC | 104 ms | 256 KB |
10.txt | AC | 106 ms | 256 KB |
11.txt | AC | 69 ms | 256 KB |
12.txt | AC | 89 ms | 256 KB |
13.txt | AC | 87 ms | 256 KB |
14.txt | AC | 107 ms | 256 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 |