Submission #3714866
Source Code Expand
#include "bits/stdc++.h" #include <iostream> #include <string.h> #include <stdio.h> #include <map> #include <vector> #include <math.h> #include <algorithm> #include <queue> #include <set> #include <tuple> using namespace std; #define FOR(i,init,a) for(int i=init; i<a; i++) #define rep(i,a) FOR(i,0,a) #define rrep(i,a) for(int i=a; i>=0; i--) #define rep1(i,a) for(int i=1; i<=a; i++) #define cout1(a) cout << a << endl; #define cout2(a,b) cout << a << " " << b << endl; #define cout3(a,b,c) cout << a << " " << b << " " << c << endl; #define cout4(a,b,c,d) cout << a << " " << b << " " << c << " " << d << endl; #define mem(a,n) memset( a, n, sizeof(a)) #define all(a) a.begin(),a.end() #define chmin(a,b) a=min(a,b); #define chmax(a,b) a=max(a,b); typedef long long ll; typedef long double ld; typedef pair<int,int> pii; typedef vector<int> V; typedef vector<V> VV; typedef vector<VV> VVV; const int INF = 1e9; const int MOD = 1e9+7; const ll LLINF = 1e18; static const double pi = 3.141592653589793; int main() { cin.tie(0); ios::sync_with_stdio(false); int N; cin>>N; ll sum=0,mn=LLINF; rep(i,N){ ll a,b; cin>>a>>b; sum+=a; if(a>b) chmin(mn,b); } if(mn==LLINF) mn=sum; cout1(sum-mn) }
Submission Info
Submission Time | |
---|---|
Task | E - Tozan and Gezan |
User | mensan_fukuhara |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1314 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 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 | AC | 5 ms | 256 KB |
02.txt | AC | 5 ms | 256 KB |
03.txt | AC | 5 ms | 256 KB |
04.txt | AC | 5 ms | 256 KB |
05.txt | AC | 5 ms | 256 KB |
06.txt | AC | 5 ms | 256 KB |
07.txt | AC | 5 ms | 256 KB |
08.txt | AC | 5 ms | 256 KB |
09.txt | AC | 5 ms | 256 KB |
10.txt | AC | 5 ms | 256 KB |
11.txt | AC | 5 ms | 256 KB |
12.txt | AC | 5 ms | 256 KB |
13.txt | AC | 5 ms | 256 KB |
14.txt | AC | 5 ms | 256 KB |
15.txt | AC | 5 ms | 256 KB |
16.txt | AC | 5 ms | 256 KB |
17.txt | AC | 5 ms | 256 KB |
18.txt | AC | 5 ms | 256 KB |
19.txt | AC | 5 ms | 256 KB |
20.txt | AC | 5 ms | 256 KB |
21.txt | AC | 5 ms | 256 KB |
22.txt | AC | 5 ms | 256 KB |
23.txt | AC | 5 ms | 256 KB |
24.txt | AC | 5 ms | 256 KB |
25.txt | AC | 5 ms | 256 KB |
26.txt | AC | 5 ms | 256 KB |
27.txt | AC | 5 ms | 256 KB |
28.txt | AC | 5 ms | 256 KB |
29.txt | AC | 5 ms | 256 KB |
30.txt | AC | 5 ms | 256 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 |