Submission #6438218
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef unsigned long long ull; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; const ull mod = 1e9 + 7; #define REP(i,n) for(int i=0;i<(int)n;++i) //debug #define dump(x) cerr << #x << " = " << (x) << endl; #define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){ os << "(" << v.first << ", " << v.second << ")"; return os; } template<class T> ostream& operator << (ostream& os, const vector<T> v){ for(int i = 0; i < v.size(); i++){if(i > 0){os << " ";} os << v[i];} return os; } template<class T> ostream& operator << (ostream& os, const vector<vector<T>> v){ for(int i = 0; i < v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os; } int main(){ cin.tie(0); ios::sync_with_stdio(false); ll N; cin >> N; vector<ll> A(N), B(N); REP(i, N) cin >> A[i] >> B[i]; bool flag = true; REP(i, N) if(A[i] != B[i]) flag = false; if(flag){ cout << 0 << endl; return 0; } ll res = 0; REP(i, N){ if(A[i] <= B[i]) res += B[i]; } cout << res << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Tozan and Gezan |
User | theory_and_me |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1324 Byte |
Status | WA |
Exec Time | 5 ms |
Memory | 768 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 700 | ||||||
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, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | WA | 5 ms | 640 KB |
02.txt | WA | 5 ms | 640 KB |
03.txt | WA | 5 ms | 640 KB |
04.txt | WA | 5 ms | 640 KB |
05.txt | WA | 5 ms | 640 KB |
06.txt | WA | 5 ms | 640 KB |
07.txt | WA | 5 ms | 640 KB |
08.txt | WA | 5 ms | 640 KB |
09.txt | WA | 5 ms | 640 KB |
10.txt | WA | 5 ms | 640 KB |
11.txt | AC | 5 ms | 640 KB |
12.txt | AC | 5 ms | 640 KB |
13.txt | AC | 5 ms | 640 KB |
14.txt | AC | 5 ms | 640 KB |
15.txt | AC | 5 ms | 640 KB |
16.txt | AC | 5 ms | 640 KB |
17.txt | AC | 5 ms | 640 KB |
18.txt | AC | 5 ms | 640 KB |
19.txt | WA | 5 ms | 640 KB |
20.txt | WA | 5 ms | 640 KB |
21.txt | WA | 5 ms | 768 KB |
22.txt | WA | 5 ms | 640 KB |
23.txt | WA | 5 ms | 640 KB |
24.txt | WA | 5 ms | 640 KB |
25.txt | WA | 5 ms | 640 KB |
26.txt | WA | 5 ms | 640 KB |
27.txt | WA | 5 ms | 640 KB |
28.txt | WA | 5 ms | 640 KB |
29.txt | WA | 5 ms | 640 KB |
30.txt | WA | 5 ms | 640 KB |
31.txt | AC | 1 ms | 256 KB |
32.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 |