Submission #1870469
Source Code Expand
#include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <ctime>
using namespace std;
#define F(i, n) for(int i = 0; i < n; ++i)
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,b,a) for (int i = (b)-1; i >= (a); i--)
#define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a,value) memset(a, value, sizeof(a))
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const LL LINF = INF * (LL) INF;
const int MAX = 100000 + 47;
int A[MAX];
int main()
{
//freopen("in.txt", "r", stdin);
int n, c, k;
scanf("%d", &n);
FOR(i, 0, n)
scanf("%d", A + i);
sort(A, A + n);
int bst = -1;
LL sum = 0;
int l = -1, r = n-1;
while(r - l > 1)
{
int m = (l+r) / 2;
int sz = A[m];
bool ok = 1;
FOR(i, 0, n)
{
if (i == m)continue;
if (2 * sz < A[i])
{
ok = 0;
break;
}
sz += A[i];
}
if (ok)r = m;
else l = m;
}
cout << n-r << endl;
}
Submission Info
Submission Time
2017-12-14 17:25:19+0900
Task
B - Colorful Creatures
User
vjudge5
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
1559 Byte
Status
WA
Exec Time
19 ms
Memory
640 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:49:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:51:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", A + i);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 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
WA
19 ms
640 KB
in10.txt
WA
8 ms
384 KB
in11.txt
WA
18 ms
640 KB
in12.txt
WA
14 ms
640 KB
in13.txt
WA
14 ms
640 KB
in2.txt
WA
19 ms
640 KB
in3.txt
WA
19 ms
640 KB
in4.txt
WA
19 ms
640 KB
in5.txt
WA
8 ms
384 KB
in6.txt
WA
17 ms
640 KB
in7.txt
WA
19 ms
640 KB
in8.txt
WA
17 ms
640 KB
in9.txt
WA
3 ms
256 KB
sample1.txt
AC
1 ms
256 KB
sample2.txt
AC
1 ms
256 KB
sample3.txt
AC
1 ms
256 KB