Submission #19125885


Source Code Expand

Copy
// #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int64, int64> ii;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

int main() {
  int n;
  cin >> n;
  vector<ii> a(n);
  int64 diff = 0;
  for (int i = 0; i < n; ++i) {
    cin >> a[i].first >> a[i].second;
    diff -= a[i].first;
  }
  sort(a.begin(), a.end(),
       [](const auto& L, const auto& R) {
         return L.first * 2 + L.second > R.first * 2 + R.second;
       });
  trace(diff);
  int ret = -1;
  for (int i = 0; i < n; ++i) {
    diff += 2 * a[i].first + a[i].second;
    if (diff > 0) {
      ret = i + 1;
      break;
    }
  }
  cout << ret << '\n';
  return 0;
}

Submission Info

Submission Time
Task D - Choose Me
User cuiaoxiang
Language C++ (Clang 10.0.0)
Score 400
Code Size 3085 Byte
Status AC
Exec Time 304 ms
Memory 6056 KB

Compile Error

./Main.cpp:78:42: warning: unused variable 'inf' [-Wunused-const-variable]
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
                                         ^
./Main.cpp:79:11: warning: unused variable 'MOD' [-Wunused-const-variable]
const int MOD = 1e9 + 7;
          ^
2 warnings generated.

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 31
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All 01_small.txt, 02_small.txt, 03_small.txt, 04_small.txt, 05_small.txt, 06_small.txt, 07_small.txt, 08_small.txt, 09_small.txt, 10_small.txt, 11_small.txt, 12_small.txt, 13_small.txt, 14_small.txt, 15_small.txt, 16_large.txt, 17_large.txt, 18_large.txt, 19_large.txt, 20_large.txt, 21_large.txt, 22_large.txt, 23_large.txt, 24_large.txt, 25_large.txt, 26_max.txt, 27_max.txt, 28_max.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
01_small.txt AC 8 ms 3176 KB
02_small.txt AC 2 ms 3168 KB
03_small.txt AC 2 ms 3120 KB
04_small.txt AC 3 ms 3204 KB
05_small.txt AC 2 ms 3020 KB
06_small.txt AC 3 ms 3204 KB
07_small.txt AC 3 ms 3052 KB
08_small.txt AC 2 ms 3168 KB
09_small.txt AC 2 ms 3148 KB
10_small.txt AC 1 ms 3068 KB
11_small.txt AC 2 ms 3012 KB
12_small.txt AC 3 ms 3168 KB
13_small.txt AC 2 ms 3120 KB
14_small.txt AC 2 ms 3172 KB
15_small.txt AC 2 ms 3040 KB
16_large.txt AC 148 ms 4084 KB
17_large.txt AC 277 ms 5824 KB
18_large.txt AC 90 ms 3576 KB
19_large.txt AC 87 ms 3540 KB
20_large.txt AC 100 ms 3832 KB
21_large.txt AC 83 ms 3560 KB
22_large.txt AC 68 ms 3296 KB
23_large.txt AC 7 ms 3212 KB
24_large.txt AC 237 ms 5104 KB
25_large.txt AC 304 ms 5776 KB
26_max.txt AC 184 ms 5900 KB
27_max.txt AC 187 ms 6056 KB
28_max.txt AC 254 ms 5816 KB
sample_01.txt AC 6 ms 3040 KB
sample_02.txt AC 2 ms 3176 KB
sample_03.txt AC 2 ms 3012 KB