Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- int main(){
- int n, p;
- cin>>n>>p;
- vector <int> a(n);
- for (int i=0; i<n; i++){
- cin>>a[i];
- }
- vector <int> b(2*n);
- for (int i=0; i<2*n; i++){
- int x=i%n;
- b[i]=a[x];
- }
- vector <int> c(n);
- for (int i=0; i<n; i++){
- long long sum=0;
- int x=0;
- int j=i;
- while (sum<p && x<n){
- sum+=b[j];
- x++;
- j++;
- }
- if (sum>=p){
- c[i]=x;
- }
- else{
- c[i]=-1;
- }
- }
- //for (int i=0; i<n; i++){
- //cout<<c[i]<<" ";
- //}
- bool k=0;
- for (int i=0; i<n; i++){
- if (c[i]!=-1){
- k=1;
- }
- }
- if (!k){
- cout<<-1<<endl;
- return 0;
- }
- long long minimum=1000000000000;
- int ans;
- for (int i=0; i<n; i++){
- if (c[i]<minimum && c[i]!=-1){
- minimum=c[i];
- ans=i;
- }
- }
- ans++;
- cout<<ans<<" "<<minimum<<endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement