Submission #1370299
Source Code Expand
/* _ _ _______ _ _ | | / / | _____| | | / / | | / / | | | | / / | |/ / | |_____ | |/ / | |\ \ | _____| | |\ \ | | \ \ | | | | \ \ | | \ \ | |_____ | | \ \ |_| \_\ |_______| |_| \_\ */ /*#include <iostream> #include <cstdio> #include <set> #include <map> #include <stack> #include <queue> #include <vector> #include <cstring> #include <string> #include <iomanip> #include <cmath> #include <algorithm> #include <assert.h>*/ #include <bits/stdc++.h> using namespace std; typedef unsigned long long ull; typedef long long ll; typedef double ld; typedef pair <int, int> PII; typedef pair <ll, ll> PLL; #define F first #define S second #define pb push_back #define eb emplace_back #define right(x) x << 1 | 1 #define left(x) x << 1 #define forn(x, a, b) for (int x = a; x <= b; ++x) #define for1(x, a, b) for (int x = a; x >= b; --x) #define mkp make_pair #define sz(a) (int)a.size() #define all(a) a.begin(), a.end() #define y1 kekekek const ll ool = 1e18 + 9; const int oo = 1e9 + 9, base = 1e9 + 7; const ld eps = 1e-7; const int N = 2e6 + 6; int n; ll a[N], sum; int main() { ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n; forn(i, 1, n) { cin >> a[i]; sum += a[i]; } sort(a + 1, a + n + 1); for1(i, n, 1) { sum -= a[i]; if (a[i] > sum * 2) { cout << n - i + 1 << "\n"; return 0; } } assert(0); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Colorful Creatures |
User | krauch |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1540 Byte |
Status | AC |
Exec Time | 18 ms |
Memory | 1024 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 17 ms | 1024 KB |
in10.txt | AC | 7 ms | 640 KB |
in11.txt | AC | 16 ms | 1024 KB |
in12.txt | AC | 13 ms | 1024 KB |
in13.txt | AC | 13 ms | 1024 KB |
in2.txt | AC | 17 ms | 1024 KB |
in3.txt | AC | 17 ms | 1024 KB |
in4.txt | AC | 18 ms | 1024 KB |
in5.txt | AC | 7 ms | 512 KB |
in6.txt | AC | 14 ms | 1024 KB |
in7.txt | AC | 17 ms | 1024 KB |
in8.txt | AC | 14 ms | 1024 KB |
in9.txt | AC | 3 ms | 384 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |