Submission #3693350
Source Code Expand
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v), end(v)
#define debug(x) std::cerr<< #x <<": "<<x<<"\n"
#define debug2(x,y) std::cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<"\n"
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::vector<int> vi;
typedef std::vector<std::vector<int> > vvi;
typedef std::vector<ll> vll;
typedef std::vector<std::vector<ll> > vvll;
typedef std::deque<bool> db;
template<class T> using vv=std::vector<std::vector< T > >;
// cout vector
template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<T>& v) {
int len=v.size();s<<"\n";rep(i,len){s<<v[i];if(i<len-1){s << "\t";}}s<<"\n";return s; }
// cout 2-dimentional vector
template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<std::vector<T> >& vv) {
int len=vv.size();rep(i,len){s<<vv[i];} return s; }
// cout deque
template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<T>& v) {
int len=v.size();s<<"\n";rep(i,len){s<<v[i];if(i<len-1){s << "\t";}}s<<"\n";return s; }
// cout 2-dimentional deque
template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<std::deque<T> >& vv) {
int len=vv.size();rep(i,len){s<<vv[i];} return s; }
// cout set<cout-able>
template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& v) {
s<<"\n";for(auto elm : v){s<<elm<<"\t";}s<<"\n";return s; }
inline void scan(int&a){scanf("%d",&a);}
inline void scan(int&a,int&b){scanf("%d%d",&a,&b);}
inline void scan(int&a,int&b,int&c){scanf("%d%d%d",&a,&b,&c);}
inline void scan(int&a,int&b,int&c,int&d){scanf("%d%d%d%d",&a,&b,&c,&d);}
inline void scan(std::vector<int>&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(std::vector<std::vector<int> >&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(ll&a,ll&b){scanf("%lld%lld",&a,&b);}
inline void scan(ll&a,ll&b,ll&c){scanf("%lld%lld%lld",&a,&b,&c);}
inline void scan(ll&a,ll&b,ll&c,ll&d){scanf("%lld%lld%lld%lld",&a,&b,&c,&d);}
inline void scan(std::vector<ll>&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(std::vector<std::vector<ll> >&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(std::vector<char>&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(std::vector<std::vector<char> >&v){int sz=v.size();rep(i,sz){scan(v[i]);}}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
inline void print(int a){printf("%d\n",a);}
inline void print(int a,int b){printf("%d %d\n",a,b);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(ll a,ll b){printf("%lld %lld\n",a,b);}
inline void print(std::string s){std::cout << s << "\n";}
inline void print_yn(bool flg){if(flg){printf("Yes\n");}else{printf("No\n");}}
using namespace std;
int main() {
int n;
scan(n);
vvll ab(n, vll(2, 0));
rep (i, n) {
scan(ab[i]);
}
sort(all(ab), [](vll x, vll y) {
ll x_ = x[0] - x[1];
ll y_ = y[0] - y[1];
return x_ < y_;
});
ll ans = 0;
ll cnt = 0;
int ind = 0;
for (; ind < n; ++ind) {
if (ab[ind][0] - ab[ind][1] >= 0) {
break;
}
ans += ab[ind][1];
cnt += ab[ind][1] - ab[ind][0];
}
if (cnt == 0) {
print(ans);
return 0;
}
for (; ind < n; ++ind) {
if (ab[ind][0] - ab[ind][1] > 0) {
break;
}
ans += ab[ind][1];
}
assert(ind != n);
ll min_elm = INT_MAX/2;
for (; ind < n; ++ind) {
ans += ab[ind][1];
min_elm = min(min_elm, ab[ind][1]);
}
ans -= min_elm;
print(ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
E - Tozan and Gezan |
User |
tspcx |
Language |
C++14 (Clang 3.8.0) |
Score |
700 |
Code Size |
4182 Byte |
Status |
AC |
Exec Time |
32 ms |
Memory |
1536 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 |
32 ms |
1408 KB |
02.txt |
AC |
32 ms |
1408 KB |
03.txt |
AC |
32 ms |
1408 KB |
04.txt |
AC |
32 ms |
1408 KB |
05.txt |
AC |
32 ms |
1408 KB |
06.txt |
AC |
32 ms |
1408 KB |
07.txt |
AC |
32 ms |
1408 KB |
08.txt |
AC |
32 ms |
1408 KB |
09.txt |
AC |
12 ms |
1536 KB |
10.txt |
AC |
12 ms |
1408 KB |
11.txt |
AC |
10 ms |
1408 KB |
12.txt |
AC |
10 ms |
1408 KB |
13.txt |
AC |
11 ms |
1408 KB |
14.txt |
AC |
11 ms |
1408 KB |
15.txt |
AC |
12 ms |
1408 KB |
16.txt |
AC |
12 ms |
1408 KB |
17.txt |
AC |
12 ms |
1408 KB |
18.txt |
AC |
12 ms |
1408 KB |
19.txt |
AC |
22 ms |
1408 KB |
20.txt |
AC |
22 ms |
1408 KB |
21.txt |
AC |
22 ms |
1408 KB |
22.txt |
AC |
22 ms |
1408 KB |
23.txt |
AC |
21 ms |
1408 KB |
24.txt |
AC |
22 ms |
1408 KB |
25.txt |
AC |
21 ms |
1408 KB |
26.txt |
AC |
21 ms |
1408 KB |
27.txt |
AC |
32 ms |
1408 KB |
28.txt |
AC |
32 ms |
1408 KB |
29.txt |
AC |
32 ms |
1408 KB |
30.txt |
AC |
32 ms |
1408 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 |