problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02784 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
long int H, N;
cin >> H >> N;
long int A[11000];
long int count = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
count += A[i];
}
if (count >= H) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
long int H, N;
cin >> H >> N;
long int A[110000];
long int count = 0;
for (int i = 0; i < N; i++) {
cin >> A[i];
count += A[i];
}
if (count >= H) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
cin >> H >> N;
int i, A, sum = 0;
for (i = 0; i < N; i++) {
cin >> A;
sum += A;
if (sum >= H) {
cout << "Yes" << endl;
exit(1);
}
}
if (i == N) {
cout << "No" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
cin >> H >> N;
int i, A, sum = 0;
for (i = 0; i < N; i++) {
cin >> A;
sum += A;
if (sum >= H) {
cout << "Yes" << endl;
exit(0);
}
}
if (i == N) {
cout << "No" << endl;
}
return 0;
}
| replace | 12 | 13 | 12 | 13 | 1 | |
p02784 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int H, N;
cin >> H >> N;
int A[10010];
int total = 0;
for (int i = 0; i < N; ++i) {
cin >> A[i];
total += A[i];
}
if (total >= H) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int H, N;
cin >> H >> N;
int A[100010];
int total = 0;
for (int i = 0; i < N; ++i) {
cin >> A[i];
total += A[i];
}
if (total >= H) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ll long long
#define mod 1000000007
#define M 1000000
using namespace std;
int isprime(ll n) {
if (n == 1)
return 0;
if (n == 2 || n == 3)
return 1;
for (int i = 2; i * i <= n; i++) {
if (n % i... | #include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ll long long
#define mod 1000000007
#define M 1000000
using namespace std;
int isprime(ll n) {
if (n == 1)
return 0;
if (n == 2 || n == 3)
return 1;
for (int i = 2; i * i <= n; i++) {
if (n % i... | replace | 25 | 26 | 25 | 26 | 0 | |
p02784 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 10000;
int main() {
int H, N, A[MAX_N];
cin >> H >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
H -= A[i];
if (H <= 0) {
cout << "Yes" << endl;
exit(0);
}
}
cout... | #include <iostream>
#include <vector>
using namespace std;
const int MAX_N = 100000;
int main() {
int H, N, A[MAX_N];
cin >> H >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
H -= A[i];
if (H <= 0) {
cout << "Yes" << endl;
exit(0);
}
}
cou... | replace | 5 | 6 | 5 | 6 | 0 | |
p02784 | Python | Runtime Error | H, N = map(int, input().split())
total_A = sum(list(map(int, input.split())))
if H <= total_A:
print("Yes")
else:
print("No")
| H, N = map(int, input().split())
total_A = sum(list(map(int, input().split())))
if H <= total_A:
print("Yes")
else:
print("No")
| replace | 1 | 2 | 1 | 2 | AttributeError: 'builtin_function_or_method' object has no attribute 'split' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02784/Python/s401209406.py", line 4, in <module>
total_A = sum(list(map(int, input.split())))
AttributeError: 'builtin_function_or_method' object has no attribute 'split'
|
p02784 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define print(n) std::cout << n << std::endl
#define print_no_indention(n) std::cout << n
using namespace std;
int main() {
int h, n;
// h = 10;
// n = 3;
cin >> h >> n;
int sum = 0;
vector<int> a;
for (int i = ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define print(n) std::cout << n << std::endl
#define print_no_indention(n) std::cout << n
using namespace std;
int main() {
int h, n;
// h = 10;
// n = 3;
cin >> h >> n;
int sum = 0;
vector<int> a(n);
for (int i... | replace | 15 | 16 | 15 | 16 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(s, i, n) for (int i = (int)s; i < (int)(n); i++)
#define pb push_back
int main() {
int h, n, sum = 0;
cin >> h >> n;
vector<int> a;
rep(i, n) {
cin >> a[i];
sum += a[i];
}
string ans = "Y... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(s, i, n) for (int i = (int)s; i < (int)(n); i++)
#define pb push_back
int main() {
int h, n, sum = 0;
cin >> h >> n;
vector<int> a(100001);
rep(i, n) {
cin >> a[i];
sum += a[i];
}
string ... | replace | 9 | 10 | 9 | 10 | -11 | |
p02784 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b, c, i; // aは相手、ｂは種類
int t[100]; // 必殺のダメージ
c = 0;
cin >> a >> b;
for (auto i = 0; i < b; i++) {
cin >> t[i];
}
for (i = 0; i < b; i++) {
c = c + t[i];
}
i = a % b;
if (c >= a) {
cout << "Yes";
} el... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int a, b, c, i; // aは相手、ｂは種類
int t[1000000]; // 必殺のダメージ
c = 0;
cin >> a >> b;
for (auto i = 0; i < b; i++) {
cin >> t[i];
}
for (i = 0; i < b; i++) {
c = c + t[i];
}
i = a % b;
if (c >= a) {
cout << "Yes";
} el... | replace | 6 | 7 | 6 | 7 | 0 | |
p02784 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cfloat>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include... | replace | 34 | 35 | 34 | 35 | TLE | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main() {
int i, j;
int H;
int N;
int sum = 0;
int A[20000];
cin >> H >> N;
fo... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
int main() {
int i, j;
int H;
int N;
int sum = 0;
int A[200000];
cin >> H >> N;
f... | replace | 18 | 19 | 18 | 19 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
#define Would
#define you
#define please
#define mp make_pair
#define pb push_back
#define INF 1000000000000
#define modulo 1000000007
#define ii pair<int, int>
#define int long long int
using namespace std;
map<int, int> performans;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0)... | #include <bits/stdc++.h>
#define Would
#define you
#define please
#define mp make_pair
#define pb push_back
#define INF 1000000000000
#define modulo 1000000007
#define ii pair<int, int>
#define int long long int
using namespace std;
map<int, int> performans;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0)... | delete | 15 | 17 | 15 | 15 | TLE | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, bool> Pair;
int main() {
int H, N;
int A[10000];
cin >> H >> N;
for (int i = 0; i < N; ++i)
cin >> A[i];
for (int ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, bool> Pair;
int main() {
int H, N;
int A[100000];
cin >> H >> N;
for (int i = 0; i < N; ++i)
cin >> A[i];
for (int... | replace | 16 | 17 | 16 | 17 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, sum = 0;
cin >> a >> b;
int ara[a];
for (int i = 0; i < b; i++)
cin >> ara[i];
for (int i = 0; i < b; i++) {
sum += ara[i];
}
if (sum >= a)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, sum = 0;
cin >> a >> b;
int ara[b];
for (int i = 0; i < b; i++)
cin >> ara[i];
for (int i = 0; i < b; i++) {
sum += ara[i];
}
if (sum >= a)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef long long ll;
int main() {
ll H, N;
ll A[10000];
scanf("%lld %lld", &H, &N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
ll sum = 0;
for (int i = 0; i < N; i++) ... | #include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
typedef long long ll;
int main() {
ll H, N;
ll A[100000];
scanf("%lld %lld", &H, &N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
ll sum = 0;
for (int i = 0; i < N; i++)... | replace | 11 | 12 | 11 | 12 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<lli> vli;
typedef priority_queue<int, vector<int>, greater<int>> min_pq;
const int MOD = 1e9 + 7;
#define fastio ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<lli> vli;
typedef priority_queue<int, vector<int>, greater<int>> min_pq;
const int MOD = 1e9 + 7;
#define fastio ... | delete | 37 | 41 | 37 | 37 | 0 | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int h, n, a[10001];
scanf("%d%d", &h, &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
sort(a, a + n);
for (int i = n - 1; i >= 0; i--) {
h -= a[i];
if (h <= 0) {
printf("Yes");
return 0;
}
}
printf("N... | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int h, n, a[100001];
scanf("%d%d", &h, &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
sort(a, a + n);
for (int i = n - 1; i >= 0; i--) {
h -= a[i];
if (h <= 0) {
printf("Yes");
return 0;
}
}
printf("... | replace | 4 | 5 | 4 | 5 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
cin >> H >> N;
int act[10010];
for (int i = 0; i < N; i++) {
cin >> act[i];
}
int dmg = 0;
for (int i = 0; i < N; i++) {
dmg += act[i];
}
if (dmg >= H)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
cin >> H >> N;
int act[100100];
for (int i = 0; i < N; i++) {
cin >> act[i];
}
int dmg = 0;
for (int i = 0; i < N; i++) {
dmg += act[i];
}
if (dmg >= H)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int N, M;
int ans = 0;
cin >> N >> M;
vector<int> A(N);
rep(i, M) {
cin >> A.at(i);
ans += A.at(i);
}
if (ans >= N)
cout << "Yes" << endl;
else
cout << "No" << ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int N, M;
int ans = 0;
cin >> N >> M;
vector<int> A(M);
rep(i, M) {
cin >> A.at(i);
ans += A.at(i);
}
if (ans >= N)
cout << "Yes" << endl;
else
cout << "No" << ... | replace | 9 | 10 | 9 | 10 | 0 | |
p02784 | C++ | Runtime Error | #include <stdio.h>
int main() {
int H, N, A[9999], i;
scanf("%d%d", &H, &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
H = H - A[i];
}
if (H <= 0)
printf("Yes");
else
printf("No");
return 0;
}
| #include <stdio.h>
int main() {
int H, N, A[100005], i;
scanf("%d%d", &H, &N);
for (i = 0; i < N; i++) {
scanf("%d", &A[i]);
H = H - A[i];
}
if (H <= 0)
printf("Yes");
else
printf("No");
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
long long MOD = 1000000007;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
long long MOD = 1000000007;
... | replace | 30 | 31 | 30 | 31 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
scanf("%d %d", &H, &N);
vector<int> A(H);
for (int &x : A)
scanf("%d", &x);
long long total = 0;
for (int x : A) {
total += x;
if (total >= H) {
printf("Yes\n");
return 0;
}
}
if (total >= H) {
pri... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
scanf("%d %d", &H, &N);
vector<int> A(N);
for (int &x : A)
scanf("%d", &x);
long long total = 0;
for (int x : A) {
total += x;
if (total >= H) {
printf("Yes\n");
return 0;
}
}
if (total >= H) {
pri... | replace | 9 | 10 | 9 | 10 | 0 | |
p02784 | C++ | Runtime Error | #include <iostream>
#define rep(i, beg, end) for (int i = (beg); i < (end); i++)
using namespace std;
int main() {
long long h, nums[10004], n;
cin >> h >> n;
long long tot = 0;
rep(i, 0, n) {
cin >> nums[i];
tot += nums[i];
}
if (tot >= h)
cout << "Yes\n";
else
cout << "No\n";
return 0... | #include <iostream>
#define rep(i, beg, end) for (int i = (beg); i < (end); i++)
using namespace std;
int main() {
long long h, nums[100004], n;
cin >> h >> n;
long long tot = 0;
rep(i, 0, n) {
cin >> nums[i];
tot += nums[i];
}
if (tot >= h)
cout << "Yes\n";
else
cout << "No\n";
return ... | replace | 5 | 6 | 5 | 6 | 0 | |
p02784 | C++ | Runtime Error | #include <cmath>
#include <iomanip>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int H, n, A[10000], sum, i;
cin >> H >> n;
sum = 0;
for (i = 0; i < n; i++) {
cin >> A[i];
sum = sum + A[i];
if (sum >= H) {
cout << "Yes";
return 0;
}
}
cout << "No";
} | #include <cmath>
#include <iomanip>
#include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int H, n, A[100000], sum, i;
cin >> H >> n;
sum = 0;
for (i = 0; i < n; i++) {
cin >> A[i];
sum = sum + A[i];
if (sum >= H) {
cout << "Yes";
return 0;
}
}
cout << "No";
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ll long long
using namespace std;
int main() {
int h, n;
vector<int> a(10000);
int count = 0;
cin >> h >> n;
rep(i, n) {
cin >> a.at(i);
count += a.at(i);
}
if (h - count <= 0) {
cout << "Yes" << endl;
}
... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ll long long
using namespace std;
int main() {
int h, n;
vector<int> a(100000);
int count = 0;
cin >> h >> n;
rep(i, n) {
cin >> a.at(i);
count += a.at(i);
}
if (h - count <= 0) {
cout << "Yes" << endl;
}
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02784 | C++ | Runtime Error | #include <stdio.h>
int main() {
int m, n, i, sum = 0;
scanf("%d %d", &m, &n);
int a;
for (i = 0; i < n; i++) {
scanf("%d", a);
sum = sum + a;
}
if (sum >= m)
printf("Yes");
else
printf("No");
} | #include <stdio.h>
int main() {
int m, n, i, sum = 0;
scanf("%d %d", &m, &n);
int a;
for (i = 0; i < n; i++) {
scanf("%d", &a);
sum = sum + a;
}
if (sum >= m)
printf("Yes");
else
printf("No");
} | replace | 7 | 8 | 7 | 8 | -11 | |
p02784 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
#pragma warning(disable : 4996)
unsigned long long int h, n, a[10000];
unsigned long long int b = 0;
int main() {
scanf("%llu %llu", &h, &n);
for (int i = 0; i != n; i++) {
scanf("%llu", &a[i]);
}
for (int i = 0; i != n; i++) {
b = b + a[i];
}
if (b >= h) {
... | #include <iostream>
#include <stdio.h>
#pragma warning(disable : 4996)
unsigned long long int h, n, a[100000];
unsigned long long int b = 0;
int main() {
scanf("%llu %llu", &h, &n);
for (int i = 0; i != n; i++) {
scanf("%llu", &a[i]);
}
for (int i = 0; i != n; i++) {
b = b + a[i];
}
if (b >= h) {
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02784 | C++ | Runtime Error | /*
author : arush gupta
date :26.01.2020
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll h, n;
ll arr[10000];
cin >> h >> n;
ll sum = 0;
for (ll i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}
... | /*
author : arush gupta
date :26.01.2020
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll h, n;
ll arr[100000];
cin >> h >> n;
ll sum = 0;
for (ll i = 0; i < n; i++) {
cin >> arr[i];
sum += arr[i];
}... | replace | 12 | 13 | 12 | 13 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y) {
long long int res = 1; // Initialize result
// x=x;
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x);
// y must be even now
y = y >> ... | #include <bits/stdc++.h>
using namespace std;
long long int power(long long int x, long long int y) {
long long int res = 1; // Initialize result
// x=x;
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x);
// y must be even now
y = y >> ... | replace | 51 | 52 | 51 | 52 | 0 | |
p02784 | C++ | Runtime Error | #include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int H, N;
scanf("%d %d", &H, &N);
int A[10005];
int sum = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
sum += A[i];
}
if (sum >= H) {
... | #include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <string>
using namespace std;
int main(int argc, char *argv[]) {
int H, N;
scanf("%d %d", &H, &N);
int A[100005];
int sum = 0;
for (int i = 0; i < N; i++) {
scanf("%d", &A[i]);
sum += A[i];
}
if (sum >= H) {
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02784 | C++ | Runtime Error | #include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int H, N;
vector<int> vec(N);
cin >> H >> N;
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int sum = accumulate(vec.begin(), vec.end(), 0);
if (H <= sum) {
string s ... | #include <iostream>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int H, N;
cin >> H;
cin >> N;
vector<int> vec(N + 1);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
int sum = accumulate(vec.begin(), vec.end(), 0);
if (H <= sum) {
... | replace | 8 | 11 | 8 | 11 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
int a[10010];
cin >> H >> N;
for (int i = 0; i < N; ++i)
cin >> a[i];
// cout<<"Hの値:"<<H<<" Nの値:"<<N<<endl;
int sum = 0;
for (int i = 0; i < N; ++i) {
// cout <<"sumに"<<a[i]<<"を代入"<<endl;
sum += a[i];
}
if (sum >= H) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, N;
int a[100010];
cin >> H >> N;
for (int i = 0; i < N; ++i)
cin >> a[i];
// cout<<"Hの値:"<<H<<" Nの値:"<<N<<endl;
int sum = 0;
for (int i = 0; i < N; ++i) {
// cout <<"sumに"<<a[i]<<"を代入"<<endl;
sum += a[i];
}
if (sum >= H)... | replace | 5 | 6 | 5 | 6 | 0 | |
p02784 | C++ | Runtime Error | #include <iostream>
using namespace std;
int nigarel[10001];
int main() {
int a, b, i, sum = 0;
cin >> a >> b;
for (i = 0; i < b; i++) {
cin >> nigarel[i];
sum += nigarel[i];
}
if (sum >= a)
cout << "Yes";
else
cout << "No";
return 0;
}
| #include <iostream>
using namespace std;
int nigarel[100001];
int main() {
int a, b, i, sum = 0;
cin >> a >> b;
for (i = 0; i < b; i++) {
cin >> nigarel[i];
sum += nigarel[i];
}
if (sum >= a)
cout << "Yes";
else
cout << "No";
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02784 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int h, n, a[10000];
cin >> h >> n;
rep(i, n) cin >> a[i];
string com = "No";
rep(i, n) {
h -= a[i];
if (h <= 0) {
com = "Yes";
break;
}
}
cout << com;
return 0... | #include <iostream>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int h, n, a[100000];
cin >> h >> n;
rep(i, n) cin >> a[i];
string com = "No";
rep(i, n) {
h -= a[i];
if (h <= 0) {
com = "Yes";
break;
}
}
cout << com;
return ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int H, N;
int A[10000];
int sum = 0;
cin >> H >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
sum += A[i];
}
cout << (sum >= H ? "Yes" : "No") << endl;
return 0;... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long H, N;
long long A[100000];
long long sum = 0;
cin >> H >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
for (int i = 0; i < N; i++) {
sum += A[i];
}
cout << (sum >= H ? "Yes" : "No") <<... | replace | 6 | 9 | 6 | 9 | 0 | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
ll inf = 100000000;
ll w[205];
ll v[205];
ll c[200005];
ll h[200005];
ll dp[105][100005];
typedef pair<int, int> P;
int main() {
ll h, n;
cin >> h >> n;
ll a[10005];
ll sum = 0;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
ll inf = 100000000;
ll w[205];
ll v[205];
ll c[200005];
ll h[200005];
ll dp[105][100005];
typedef pair<int, int> P;
int main() {
ll h, n;
cin >> h >> n;
ll a[100005];
ll sum = 0;... | replace | 18 | 19 | 18 | 19 | 0 | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
// Your code here!
long long int N, M, H, W, x, i, j, k, ans, count, cost, tmp, a, b, c, d, c1,
c2, HP;
long long int S[11000];
// long long int T[11000];
// long long int U[300000];
// lo... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
// Your code here!
long long int N, M, H, W, x, i, j, k, ans, count, cost, tmp, a, b, c, d, c1,
c2, HP;
long long int S[110000];
// long long int T[11000];
// long long int U[300000];
// l... | replace | 9 | 10 | 9 | 10 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, n;
cin >> h >> n;
vector<int> v(h);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
sum += v[i];
}
if (sum >= h)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int h, n;
cin >> h >> n;
vector<int> v(n);
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
sum += v[i];
}
if (sum >= h)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int h, n, a[10000] = {}, m = 0;
cin >> h >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
m += a[i];
}
if (m >= h)
cout << "Yes" << endl;
else
cout << "No" << end... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int h, n, a[100000] = {}, m = 0;
cin >> h >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
m += a[i];
}
if (m >= h)
cout << "Yes" << endl;
else
cout << "No" << en... | replace | 8 | 9 | 8 | 9 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long h, n, s = 0, a[10005];
cin >> h >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
if (s >= h)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
long long h, n, s = 0, a[100005];
cin >> h >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
s += a[i];
}
if (s >= h)
cout << "Yes\n";
else
cout << "No\n";
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(void) {
long long h, n, a[10001];
cin >> h >> n;
rep(i, n) {
cin >> a[i];
h -= a[i];
}
if (h > 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main(void) {
long long h, n, a[100001];
cin >> h >> n;
rep(i, n) {
cin >> a[i];
h -= a[i];
}
if (h > 0) {
cout << "No" << endl;
} else {
cout << "Yes" << endl;
}
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02784 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define revp(i, a, b) for (int i = b; i >= a; i--)
int h, n, temp, sum = 0;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freop... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define revp(i, a, b) for (int i = b; i >= a; i--)
int h, n, temp, sum = 0;
int main() {
cin >> h >> n;
while (n--)
cin >> temp, sum += temp;
if (sum >= h)
cout << "Yes";
else
cout... | delete | 9 | 15 | 9 | 9 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
int main() {
long long int i, a, b, arr[10000], sum;
scanf("%lld %lld", &a, &b);
sum = 0;
for (i = 0; i < b; i++) {
scanf("%lld", &arr[i]);
sum += arr[i];
}
if (sum >= a) {
printf("Yes");
} else {
printf("No");
}
printf("\n");
return 0;
}
| #include <bits/stdc++.h>
int main() {
long long int i, a, b, arr[100000], sum;
scanf("%lld %lld", &a, &b);
sum = 0;
for (i = 0; i < b; i++) {
scanf("%lld", &arr[i]);
sum += arr[i];
}
if (sum >= a) {
printf("Yes");
} else {
printf("No");
}
printf("\n");
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02784 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, d;
int c[10000];
cin >> a >> b;
d = 0;
for (int i = 0; i < b; i++) {
cin >> c[i];
}
for (int i = 0; i < b; i++) {
d = d + c[i];
}
if (d >= a)
cout << "Yes";
if (d < a)
cout << "No";
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, d;
int c[100000];
cin >> a >> b;
d = 0;
for (int i = 0; i < b; i++) {
cin >> c[i];
}
for (int i = 0; i < b; i++) {
d = d + c[i];
}
if (d >= a)
cout << "Yes";
if (d < a)
cout << "No";
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
typedef long long ll;
int main() {
int h, n;
cin >> h >> n;
vector<int> a(n);
rep(i, n) { cin >> a.at(i); }
sort(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define INF 1e9
#define PI 3.14159265359
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
typedef long long ll;
int main() {
int h, n;
cin >> h >> n;
vector<int> a(n);
ll sum = 0;
rep(i, n) {
cin >> ... | replace | 12 | 15 | 12 | 17 | 0 | |
p02784 | C++ | Runtime Error | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "ctime"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "str... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "ctime"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "str... | replace | 37 | 38 | 37 | 38 | 0 | |
p02784 | C++ | Runtime Error | /* / \ (Hello)//JSM//*/
/* /*****\ */
/* Jai Shree Mataji / \ |\| |_| $ |-| K */
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string.h>
#i... | /* / \ (Hello)//JSM//*/
/* /*****\ */
/* Jai Shree Mataji / \ |\| |_| $ |-| K */
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string.h>
#i... | replace | 191 | 192 | 191 | 192 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for... | replace | 25 | 26 | 25 | 26 | 0 | |
p02784 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int h = 0, x = 0, o = 0;
cin >> h;
cin >> x;
vector<int> n(h);
for (int i = 0; i < x; i++) {
cin >> n[i];
o = o + n[i];
}
h = h - o;
if (h <= 0) {
cout << "Yes";
} else if (h > 0) {
cout << "No";
}
cout << endl... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int h = 0, x = 0, o = 0;
cin >> h;
cin >> x;
vector<int> n(x);
for (int i = 0; i < x; i++) {
cin >> n[i];
o = o + n[i];
}
h = h - o;
if (h <= 0) {
cout << "Yes";
} else if (h > 0) {
cout << "No";
}
cout << endl... | replace | 7 | 8 | 7 | 8 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int H = 0, N = 0, A[210];
cin >> H >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int sum = 0;
for (int i = 0; i < N; i++) {
sum = sum + A[i];
}
if (H - sum <= 0) {
cout << "Yes" << endl;
} else {
cout << "No" <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int H = 0, N = 0, A[1000000];
cin >> H >> N;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
int sum = 0;
for (int i = 0; i < N; i++) {
sum = sum + A[i];
}
if (H - sum <= 0) {
cout << "Yes" << endl;
} else {
cout << "N... | replace | 5 | 6 | 5 | 6 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cou... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define FIO \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cou... | replace | 11 | 12 | 11 | 12 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, start, end) for (int i = start; i < (int)(end); ++i)
int a[10010];
int main() {
int h, n;
cin >> h >> n;
rep(i, 0, n) cin >> a[i];
rep(i, 0, n) h -= a[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, start, end) for (int i = start; i < (int)(end); ++i)
int a[100010];
int main() {
int h, n;
cin >> h >> n;
rep(i, 0, n) cin >> a[i];
rep(i, 0, n) h -= a[i];
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
#define ll long long
#define DS pair<ll, ll>
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
const int N = 1005;
const int M... | #include <bits/stdc++.h>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
using namespace std;
// using namespace __gnu_pbds;
#define ll long long
#define DS pair<ll, ll>
#define READ(f) freopen(f, "r", stdin)
#define WRITE(f) freopen(f, "w", stdout)
const int N = 3e5 + 5;
const in... | replace | 12 | 13 | 12 | 13 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define inf 100000000000000000
#define ll long long int
#define pb push_back
#define f first
#define s second
#define mod 1000000007
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
void mahakal() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r"... | #include <bits/stdc++.h>
using namespace std;
#define inf 100000000000000000
#define ll long long int
#define pb push_back
#define f first
#define s second
#define mod 1000000007
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
void mahakal() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r"... | replace | 18 | 20 | 18 | 19 | TLE | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define BeatMeScanf \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
int arr[10005... | #include <bits/stdc++.h>
using namespace std;
#define BeatMeScanf \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
int arr[10000... | replace | 7 | 8 | 7 | 8 | 0 | |
p02784 | C++ | Runtime Error | #include <array>
#include <iostream>
using namespace std;
int main() {
int H, N;
cin >> H;
cin >> N;
array<int, 10000> A;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
bool result = false;
for (int i = 0; i < N; i++) {
H = H - A[i];
if (H <= 0) {
result = true;
break;
}
... | #include <array>
#include <iostream>
using namespace std;
int main() {
int H, N;
cin >> H;
cin >> N;
array<int, 100000> A;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
bool result = false;
for (int i = 0; i < N; i++) {
H = H - A[i];
if (H <= 0) {
result = true;
break;
}
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02784 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll N, i, H, s = 0, A[10005];
cin >> H >> N;
for (i = 0; i < N; i++)
cin >> A[i];
for (i = 0; i < N; i++)
s += A[i];
if (s >= H)
cout << "Yes";
else
cout << "No";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
int main() {
ll N, i, H, s = 0, A[100000];
cin >> H >> N;
for (i = 0; i < N; i++)
cin >> A[i];
for (i = 0; i < N; i++)
s += A[i];
if (s >= H)
cout << "Yes";
else
cout << "No";
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02784 | Python | Runtime Error | # ABC153
# B Common Raccoon VS Monster
h, n = map(int, input().split())
a = list(map(int, input().split()))
s = sum(a)
if a <= s:
print("Yes")
else:
print("No")
| # ABC153
# B Common Raccoon VS Monster
h, n = map(int, input().split())
a = list(map(int, input().split()))
s = sum(a)
if h <= s:
print("Yes")
else:
print("No")
| replace | 5 | 6 | 5 | 6 | TypeError: '<=' not supported between instances of 'list' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02784/Python/s611201002.py", line 7, in <module>
if a <= s:
TypeError: '<=' not supported between instances of 'list' and 'int'
|
p02784 | C++ | Runtime Error | /*#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC
target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma
GCC optimize("unroll-loops") #pragma GCC optimize("fast-math")*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigne... | /*#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC
target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") #pragma
GCC optimize("unroll-loops") #pragma GCC optimize("fast-math")*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigne... | replace | 29 | 30 | 29 | 30 | 0 | |
p02785 | C++ | Runtime Error | /* be name khoda */
// #define stream_enable
#define long_enable
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
#ifdef stream_enable
#define cin sss
#endif
#ifdef... | /* be name khoda */
// #define stream_enable
#define long_enable
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
#ifdef stream_enable
#define cin sss
#endif
#ifdef... | replace | 97 | 98 | 97 | 98 | 0 | |
p02785 | C++ | Runtime Error | /* ###########################
# Author : Pranay Garg #
# College : SGSITS #
###########################
*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#... | /* ###########################
# Author : Pranay Garg #
# College : SGSITS #
###########################
*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#... | replace | 221 | 222 | 221 | 222 | 0 | Time: 27 ms
|
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int N, K;
int H[100001];
int main() {
c... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int N, K;
int H[200001];
int main() {
c... | replace | 17 | 18 | 17 | 18 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define FOR(i, m, n) for (long long i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define RS(x) rsort(x.begin(),x,end()))
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(x) (x).begin(), (... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (long long i = 0; i < (long long)(n); i++)
#define FOR(i, m, n) for (long long i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define RS(x) rsort(x.begin(),x,end()))
#define REVE(x) reverse(x.begin(), x.end())
#define ALL(x) (x).begin(), (... | insert | 15 | 15 | 15 | 17 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll ans[20005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> ans[i];
}
sort(ans, ans + n);
if (n <= k) {
cout << 0 << endl;
return 0;
} else {
ll sum = 0;
for (int i = 0; i < n - k; i++... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll ans[200005];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> ans[i];
}
sort(ans, ans + n);
if (n <= k) {
cout << 0 << endl;
return 0;
} else {
ll sum = 0;
for (int i = 0; i < n - k; i+... | replace | 6 | 7 | 6 | 7 | 0 | |
p02785 | C++ | Time Limit Exceeded | // ConsoleApplication15.cpp : 此文件包含 "main"
// 函数。程序执行将在此处开始并结束。
//
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
using namespace std;
int hn[200500];
int main() {
double n, k, ci;
int i;
while (cin >> n >> k) {
ci = 0;
for (i = 0; i < n; i++) {
cin >... | // ConsoleApplication15.cpp : 此文件包含 "main"
// 函数。程序执行将在此处开始并结束。
//
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
using namespace std;
int hn[200500];
int main() {
double n, k, ci;
int i;
while (cin >> n >> k) {
ci = 0;
for (i = 0; i < n; i++) {
cin >... | replace | 20 | 24 | 20 | 21 | TLE | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[100001];
int n, k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
long long sum = 0;
for (int i = 1; i <= n - k; i++)
sum += a[i];
cout << sum << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[200001];
int n, k;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
long long sum = 0;
for (int i = 1; i <= n - k; i++)
sum += a[i];
cout << sum << endl;
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LL long long
#define maxn 100010
using namespace std;
int n[maxn];
int main() {
int a, b;
cin >> a >> b;
for (int i = 0; i < a; ++i) {
cin >> n[i];
}
sort(n, n + a);
LL ans = 0;
for (int i = 0; i < a - b; ++i) {
ans = ans + n[i];
}
cout << ans << endl;
retu... | #include <bits/stdc++.h>
#define LL long long
#define maxn 200010
using namespace std;
int n[maxn];
int main() {
int a, b;
cin >> a >> b;
for (int i = 0; i < a; ++i) {
cin >> n[i];
}
sort(n, n + a);
LL ans = 0;
for (int i = 0; i < a - b; ++i) {
ans = ans + n[i];
}
cout << ans << endl;
retu... | replace | 2 | 3 | 2 | 3 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, K;
cin >> N >> K;
vector<long long> H(N);
for (long long i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
for (long long i = 0; i < K; i++) {
H[i] = 0;
}
long long S = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long N, K;
cin >> N >> K;
vector<long long> H(N);
for (long long i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
for (long long i = 0; i < K; i++) {
H[i] = 0;
if (i == N) {
b... | insert | 14 | 14 | 14 | 17 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define double long dou... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define double long dou... | replace | 116 | 117 | 116 | 117 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
rep(i, k) h[n - 1 - i] = 0;
ll ans = 0;
rep(i, n) ans += h[i];
cout << ans << endl;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<ll> h(n);
rep(i, n) cin >> h[i];
sort(h.begin(), h.end());
rep(i, min(k, n)) h[n - 1 - i] = 0;
ll ans = 0;
rep(i, n) ans += h[i];
cout << ans ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// 自作関数
template <clas... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// 自作関数
template <clas... | insert | 34 | 34 | 34 | 38 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, n) for (long long i = 1; i < n; i++)
#define ll long long
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#defi... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < n; i++)
#define Rep(i, n) for (long long i = 1; i < n; i++)
#define ll long long
#include <cmath>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#defi... | insert | 24 | 24 | 24 | 25 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; ++i)
cin >> h[i];
sort(h.begin(), h.end(), greater<ll>());
for (ll i = 0; i < k; ++i)
h[i] = 0;
ll sum = 0;
for (ll i = 0; i < n; ++i)
sum += h[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> h(n);
for (ll i = 0; i < n; ++i)
cin >> h[i];
sort(h.begin(), h.end(), greater<ll>());
if (n >= k) {
for (ll i = 0; i < k; ++i)
h[i] = 0;
} else {
for (ll i = 0; i < n; ++i... | replace | 10 | 12 | 10 | 17 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// Optimization
// #pragma GCC optimize("O3")
#define endl '\n'
// Shortcut
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#d... | #include <bits/stdc++.h>
using namespace std;
// Optimization
// #pragma GCC optimize("O3")
#define endl '\n'
// Shortcut
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#d... | replace | 85 | 86 | 85 | 86 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
long long a[N], ans;
int n, k;
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
for (int i = k + 1; i <= n; i++)
ans += a[i];
cou... | #include <bits/stdc++.h>
using namespace std;
const int N = 200005;
long long a[N], ans;
int n, k;
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
reverse(a + 1, a + n + 1);
for (int i = k + 1; i <= n; i++)
ans += a[i];
cou... | replace | 2 | 3 | 2 | 3 | 0 | |
p02785 | C++ | Runtime Error | // 競技プログラミング用のテンプレート
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using ll = lo... | // 競技プログラミング用のテンプレート
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
using ll = lo... | replace | 29 | 30 | 29 | 34 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | replace | 54 | 56 | 54 | 56 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// define
typedef pair<int, int> pi;
#define int long long
#define elif else if
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define Rep(x, y) for (int k = x; k < y; k++)
#define all(x) x.begin(), x.end()
#define pb push_back
#... | #include <bits/stdc++.h>
using namespace std;
// define
typedef pair<int, int> pi;
#define int long long
#define elif else if
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define Rep(x, y) for (int k = x; k < y; k++)
#define all(x) x.begin(), x.end()
#define pb push_back
#... | replace | 40 | 41 | 40 | 44 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> v;
int move = 0;
long long s[100001];
for (int i = 0; i < n; i++)
cin >> s[i];
for (int i = 0; i < n; i++)
v.push_back(s[i]);
sort(v.begin(), v.end());
for (int i = 0; i < n - m; i++)
move += v[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<long long> v;
long long move = 0;
long long s;
for (int i = 0; i < n; i++) {
cin >> s;
v.push_back(s);
}
sort(v.begin(), v.end());
for (int i = 0; i < n - m; i++)
move += v[i];
cout << move << endl... | replace | 5 | 12 | 5 | 12 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long N, K;
long long H[20000];
long long sum = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H, H + N, greater<long long int>());
for (int i = K; i < N; i++) {
sum += H[i];... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
long long N, K;
long long H[200000];
long long sum = 0;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H, H + N, greater<long long int>());
for (int i = K; i < N; i++) {
sum += H[i]... | replace | 7 | 8 | 7 | 8 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
ll H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H, H + N);
reverse(H, H + N);
for (int i = 0; i < K; i++) {
H[i] = 0;
}
ll ans = 0;
for (int i = 0; i < N; i++) {
ans += ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N, K;
cin >> N >> K;
ll H[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H, H + N);
reverse(H, H + N);
for (int i = 0; i < min(K, N); i++) {
H[i] = 0;
}
ll ans = 0;
for (int i = 0; i < N; i++) {
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
long long aa[b];
long long sum = 0;
for (long long i = 0; i < a; i++) {
cin >> aa[i];
}
sort(aa, aa + a);
if (b >= a)
cout << "0" << endl;
else {
for (long long i = 0; i < a - b; i++) {
sum += ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
long long aa[a];
long long sum = 0;
for (long long i = 0; i < a; i++) {
cin >> aa[i];
}
sort(aa, aa + a);
if (b >= a)
cout << "0" << endl;
else {
for (long long i = 0; i < a - b; i++) {
sum += ... | replace | 5 | 6 | 5 | 6 | 0 | |
p02785 | C++ | Runtime Error | #include <cstdlib>
#include <iostream>
using namespace std;
int comp(const void *a, const void *b) {
if ((*(unsigned long *)(a)) < (*(unsigned long *)(b))) {
return -1;
}
if ((*(unsigned long *)(a)) > (*(unsigned long *)(b))) {
return 1;
}
return 0;
}
int main() {
unsigned long N, K;
cin >> N >> K... | #include <cstdlib>
#include <iostream>
using namespace std;
int comp(const void *a, const void *b) {
if ((*(unsigned long *)(a)) < (*(unsigned long *)(b))) {
return -1;
}
if ((*(unsigned long *)(a)) > (*(unsigned long *)(b))) {
return 1;
}
return 0;
}
int main() {
unsigned long N, K;
cin >> N >> K... | insert | 15 | 15 | 15 | 19 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define INF 10000000001
#define DIM 200001
#define mod 1000000007
#define PI 3.1415926535897932384626433
#define se second
#define fi first
#define pb push_back
#define T true
#define F false
#define en... | #include <bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define INF 10000000001
#define DIM 200001
#define mod 1000000007
#define PI 3.1415926535897932384626433
#define se second
#define fi first
#define pb push_back
#define T true
#define F false
#define en... | replace | 27 | 28 | 27 | 28 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
long long int N, K;
cin >> N >> K;
vector<long long int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
for (int i = 0; i < K; i++) {
H[i] = 0;
}
long... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
long long int N, K;
cin >> N >> K;
vector<long long int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
sort(H.begin(), H.end());
reverse(H.begin(), H.end());
if (N <= K) {
for (int i = 0; i < N; i++) {
H... | replace | 17 | 19 | 17 | 27 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <... | replace | 63 | 64 | 63 | 64 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define sz(x) int(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define INF 2e... | insert | 38 | 38 | 38 | 40 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
typedef long long ll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utility>
#include <vector>
typedef long long ll;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const... | replace | 59 | 60 | 59 | 65 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | replace | 83 | 84 | 83 | 88 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k, h[1000000005], i, ans;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n, greater<int>());
for (i = k; i < n; i++) {
ans = ans + h[i];
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long long int n, k, h[200005], i, ans;
cin >> n >> k;
for (i = 0; i < n; i++) {
cin >> h[i];
}
sort(h, h + n, greater<int>());
for (i = k; i < n; i++) {
ans = ans + h[i];
}
cout << ans << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | -11 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
signed main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
ans += h[i];
}
sort(h.rbegin(), h.rend());
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
signed main() {
int n, k;
cin >> n >> k;
vector<int> h(n);
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> h[i];
ans += h[i];
}
sort(h.rbegin(), h.rend());
for (int i = 0... | replace | 19 | 20 | 19 | 20 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#define fori(x) for (int i = 0; i < x; ++i)
// cout << fixed << setprecision(10) << num << endl;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[110000];
fori(n) cin >> h[i];
sort(h, h + n, gr... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#define fori(x) for (int i = 0; i < x; ++i)
// cout << fixed << setprecision(10) << num << endl;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int h[220000];
fori(n) cin >> h[i];
sort(h, h + n, gr... | replace | 15 | 16 | 15 | 16 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, k, h[100010];
int main() {
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
sort(h, h + n);
long long ans = 0;
for (int i = 0; i < n - k; ++i) {
ans += h[i];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, k;
long long h[200010];
int main() {
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
sort(h, h + n);
long long ans = 0;
for (int i = 0; i < n - k; ++i) {
ans += h[i];
}
cout << ans << endl;
return 0;
} | replace | 3 | 4 | 3 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, n;
cin >> h >> n;
long long a[n + 1], sum = 0;
for (int i = 0; i < h; i++)
cin >> a[i];
sort(a, a + h);
for (int i = 0; i < h - n; i++)
sum += a[i];
cout << sum;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int h, n;
cin >> h >> n;
long long a[h + 1], sum = 0;
for (int i = 0; i < h; i++)
cin >> a[i];
sort(a, a + h);
for (int i = 0; i < h - n; i++)
sum += a[i];
cout << sum;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void) {
int N, K;
cin >> N >> K;
vector<int> H(N);
rep(i, N) cin >> H[i];
sort(all(H));
rep(i, K) ... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (N); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int inf{int(1e9)};
int main(void) {
int N, K;
cin >> N >> K;
vector<int> H(N);
rep(i, N) cin >> H[i];
sort(all(H));
K = min(K,... | insert | 13 | 13 | 13 | 14 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX
#define INFL LLONG_MAX
typedef long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
vector<l... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define puts(i) cout << i << endl
#define INF INT_MAX
#define INFL LLONG_MAX
typedef long long ll;
using namespace std;
int main() {
ll n, k;
cin >> n >> k;
ll ans = 0;
vector<l... | replace | 23 | 24 | 23 | 24 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll a[100010];
int main() {
int i, j, k;
ll H, N;
ll ans = 0;
cin >> N >> k;
for (i = 0; i < N; i++) {
cin >> a[i];
}
sort(a, a + N);
for (i = 0; i < N - k; i++) {
ans += a[i];
}
cout << ans << endl;
ret... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll a[200010];
int main() {
int i, j, k;
ll H, N;
ll ans = 0;
cin >> N >> k;
for (i = 0; i < N; i++) {
cin >> a[i];
}
sort(a, a + N);
for (i = 0; i < N - k; i++) {
ans += a[i];
}
cout << ans << endl;
ret... | replace | 4 | 5 | 4 | 5 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long int n, k, c = 0;
cin >> n >> k;
vector<int> a(100000);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), std::greater<>());
for (int i = k; i < n; i++) {
c +... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int main() {
long long int n, k, c = 0;
cin >> n >> k;
vector<long long int> a(10000000);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), std::greater<>());
for (int i = k; i < n; i+... | replace | 9 | 10 | 9 | 10 | 0 | |
p02785 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | replace | 39 | 41 | 39 | 46 | 0 | |
p02785 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, i;
cin >> n >> k;
long long int arr[100005];
for (i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
if (k >= n) {
printf("0\n");
} else {
long long int sum = 0;
for (i = 0; i < n - k; i++) {
sum ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k, i;
cin >> n >> k;
long long int arr[200005];
for (i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
if (k >= n) {
printf("0\n");
} else {
long long int sum = 0;
for (i = 0; i < n - k; i++) {
sum ... | replace | 5 | 6 | 5 | 6 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.